Establishing order in planar subdivisions
Open Access
- 1 September 1988
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 3 (3) , 267-280
- https://doi.org/10.1007/bf02187912
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- Computational GeometryPublished by Springer Nature ,1985
- A kinetic framework for computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973