Location of a Point in a Planar Subdivision and Its Applications
From MaRDI portal
Publication:4133115
DOI10.1137/0206043zbMATH Open0357.68034OpenAlexW2004389974MaRDI QIDQ4133115FDOQ4133115
Authors:
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206043
Cited In (43)
- Dynamic Trees and Dynamic Point Location
- Comparison of various trees for nearest-point search with/without the Voronoi diagram.
- Efficient visibility queries in simple polygons
- Storing the subdivision of a polyhedral surface
- Translating a convex polyhedron over monotone polyhedra
- Finding the intersection of two convex polyhedra
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- On decomposing polygons into uniformly monotone parts
- Triangulating a simple polygon
- Generalized Delaunay triangulation for planar graphs
- Query point visibility computation in polygons with holes
- Establishing order in planar subdivisions
- Dynamic maintenance of planar digraphs, with applications
- Guarding curvilinear art galleries with vertex or point guards
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
- Bounds for point recolouring in geometric graphs
- Using geometry to solve the transportation problem in the plane
- Uniformly monotone partitioning of polygons
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Voronoi diagrams from convex hulls
- Optimal cooperative search in fractional cascaded data structures
- On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples
- An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
- A note on the graph isomorphism counting problem
- Moving a disc between polygons
- A space-optimal solution of general region location
- A fast algorithm for point-location in a finite element mesh
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- Visibility with a moving point of view
- An incremental reconstruction method for dynamic planar point location
- Dynamic planar point location with optimal query time
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Adaptive Point Location in Planar Convex Subdivisions
- Computational and structural advantages of circular boundary representation
- Minimum k-partitioning of rectilinear polygons
- Decomposition and intersection of simple splinegons
- Affine invariant triangulations
- The design and analysis of a new hybrid sorting algorithm
- Fractional cascading. II: Applications
- Dynamic planar point location with optimal query time (extended abstract)
- Complexity of projected images of convex subdivisions
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
This page was built for publication: Location of a Point in a Planar Subdivision and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133115)
