Topologically sweeping an arrangement
- 28 February 1989
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 38 (1), 165-194
- https://doi.org/10.1016/0022-0000(89)90038-x
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Computational Geometry--An Introduction.Mathematics of Computation, 1986
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- Sets with No Empty Convex 7-GonsCanadian Mathematical Bulletin, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976