Computing a sweeping-plane in regular (“general”) position: a numerical and a symbolic solution
Journal of Symbolic Computation
Non-convex contour reconstruction
Journal of Symbolic Computation
Extending Rectangle Join Algorithms for Rectilinear Polygons
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Structure Theorems for Systems of Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
On Multi-way Spatial Joins with Direction Predicates
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Minimizing a Convex Cost Closure Set
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Toward Spatial Joins for Polygons
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
Counting and Reporting Intersections of d-Ranges
IEEE Transactions on Computers
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Computational Geometry on a Systolic Chip
IEEE Transactions on Computers
Set Membership Classification: A Unified Approach to Geometric Intersection Problems
IEEE Transactions on Computers
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
IEEE Transactions on Computers
Incremental analysis of large VLSI Layouts
Integration, the VLSI Journal
Determining directional distances between points and shorelines using sweep line technique
International Journal of Geographical Information Science
Region Extraction and Verification for Spatial and Spatio-temporal Databases
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
Approximating centroids for the maximum intersection of spherical polygons
Computer-Aided Design
Tool path generation for a surface model with defects
Computers in Industry
A parallel plane sweep algorithm for multi-core systems
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
User defined topological predicates in database systems
Geoinformatica
Ensuring the semantic correctness of complex regions
ER'07 Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications
Geospatial overlay computation on the GPU
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
International Journal of Computer Vision
A faster algorithm for solving one-clock priced timed games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
DREAMS: DFM rule EvAluation using manufactured silicon
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.02 |
We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout. Given N line segments in the plane, finding all intersecting pairs requires O(N2) time. We give an O(N log N) algorithm to determine whether any two intersect and use it to detect whether two simple plane polygons intersect. We employ an O(N log N) algorithm for finding the common intersection of N half-planes to show that the Simplex method is not optimal. The emphasis throughout is on obtaining upper and lower bounds and relating these results to other problems in computational geometry.