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


Scanline algorithms on a grid
Authors:Rolf G Karlsson  Mark H Overmars
Institution:(1) Dept. of Computer Science, Linköping University, 581 83 Linköping, Sweden;(2) Dept. of Computer Science, University of Utrecht, P.O. Box 80.012, 3508, TA Utrecht, The Netherlands
Abstract:A number of important problems in computational geometry are solved efficiently on 2- or 3-dimensional grids by means of scanline techniques. In the time complexity of solutions to the maximal elements and closure problems, a factor logn is substituted by loglogn, wheren is the number of elements. Next, by using a data structure introduced in the paper, the interval trie, previous solutions to the rectangle intersection and connected component problems are improved upon. Finally, a fast intersection finding algorithm for arbitrarily oriented line segments is presented.
Keywords:E  2  F  2  2
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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