Optimal Search in Planar Subdivisions
From MaRDI portal
Publication:3967063
Cited in
(only showing first 100 items - show all)- An incremental reconstruction method for dynamic planar point location
- Rotationally monotone polygons
- Clamshell casting
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
- Three problems about simple polygons
- On polyhedra induced by point sets in space
- Triangulating point sets in space
- Practical distribution-sensitive point location in triangulations
- Relative (p, )-approximations in geometry
- A workbench for computational geometry
- Dynamic planar point location with optimal query time
- Algorithms for high dimensional stabbing problems
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
- Succinct and Implicit Data Structures for Computational Geometry
- A simple but effective improvement to the plumb-line algorithm
- Faster goal-oriented shortest path search for bulk and incremental detailed routing
- Separating a polyhedron by one translation from a set of obstacles
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- The shortest watchtower and related problems for polyhedral terrains
- Computational geometry in a curved world
- WALKING IN A TRIANGULATION
- Adaptive Point Location in Planar Convex Subdivisions
- Deferred data structure for the nearest neighbor problem
- Computing the intersection-depth to polyhedra
- Decomposition and intersection of simple splinegons
- Triangulating a nonconvex polytope
- Rooted Uniform Monotone Minimum Spanning Trees
- Tight bounds for connecting sites across barriers
- The first subquadratic algorithm for complete linkage clustering
- Shortest paths in the plane with obstacle violations
- Computing circular separability
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- Randomized approximation algorithms for planar visibility counting problem
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Minimizing the sum of diameters efficiently
- Pareto envelopes in simple polygons
- Spanning trees with low crossing number
- On Combinatorial Depth Measures
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- A multifacility location problem on median spaces
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- On rectilinear link distance
- Input-sensitive compliant motion in the plane
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
- New upper bounds for generalized intersection searching problems
- Linear time approximation of 3D convex polytopes
- Spanners for directed transmission graphs
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- I/O-efficient dynamic planar point location
- The power of geometric duality revisited
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Semi-Lagrangian methods for level set equations
- On separating two simple polygons by a single translation
- Bottleneck detour tree of points on a path
- Computing constrained minimum-width annuli of point sets
- Partitioning arrangements of lines. II: Applications
- \(L_{1}\) shortest path queries in simple polygons
- Outlier respecting points approximation
- I/O-efficient path traversal in succinct planar graphs
- Geometric path problems with violations
- Efficient approximate shortest-path queries among isothetic rectangular obstacles
- Dynamic planar point location with optimal query time (extended abstract)
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- I/O-efficient point location using persistent B-trees
- Computing largest empty circles with location constraints
- Applications of generalized matrix searching to geometric algorithms
- Decomposing the boundary of a nonconvex polyhedron
- Proximity problems for points on a rectilinear plane with rectangular obstacles
- External memory planar point location with logarithmic updates
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- Query-point visibility constrained shortest paths in simple polygons
- Diameter, width, closest line pair, and parametric searching
- Closest-pair queries and minimum-weight queries are equivalent for squares
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
- How to pack directed acyclic graphs into small blocks
- Dynamic Trees and Dynamic Point Location
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- On fast planning of suboptimal paths amidst polygonal obstacles in plane
- Locating two obnoxious facilities using the weighted maximin criterion
- Efficient visibility queries in simple polygons
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
- Storing the subdivision of a polyhedral surface
- Hausdorff approximation of 3D convex polytopes
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Dilation-Optimal Edge Deletion in Polygonal Cycles
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- An approximate algorithm for computing multidimensional convex hulls
- Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- An algorithmic approach to some problems in terrain navigation
- Reporting and counting segment intersections
- Time-space trade-offs for triangulations and Voronoi diagrams
- Line arrangements and range search
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Geometric complexity of some location problems
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
This page was built for publication: Optimal Search in Planar Subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967063)
