首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Lower bounds on the length of monotone paths in arrangements
Authors:Jiří Matoušek
Institution:(1) Department of Computer Science, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czechoslovakia
Abstract:We show that the maximal number of turns of anx-monotone path in an arrangement ofn lines is Ω(n 5/3) and the maximal number of turns of anx-monotone path in arrangement ofn pseudolines is Ω(n 2/logn).
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号