Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Optimal point location in a monotone subdivision
SIAM Journal on Computing
The complexity of robot motion planning
The complexity of robot motion planning
Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
On levels in arrangements and Voronoi diagrams
Discrete & Computational Geometry
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics (TOG)
A fast planar partition algorithm, II
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing many faces in arrangements of lines and segments
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing envelopes in four dimensions with applications
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Fly cheaply: on the minimum fuel-consumption problem
Proceedings of the fourteenth annual symposium on Computational geometry
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
| Hi-index | 0.00 |
Randomized, optimal algorithms to find a partition of the plane induced by a set of algebraic segments of a bounded degree, and a set of linear chains of a bounded degree, are given. This paper also provides a new technique for clipping, called virtual clipping, whose overhead per window W depends logarithmically on the number if intersections between the borders of W and the input segments. In contrast, the overhead of the conventional clipping technique depends linearly on this number of intersections. As an application of virtual clipping, a new simple and efficient algorithm for plannar point location is given.