Optimal Search in Planar Subdivisions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Low complexity algorithms for optimal consumer push-pull partial covering in the plane
- Point set stratification and Delaunay depth
- Rotationally monotone polygons
- Clamshell casting
- The power of geometric duality revisited
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Generalized Delaunay triangulation for planar graphs
- Computing circular separability
- The power of geometric duality
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- Geometric complexity of some location problems
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Decomposition and intersection of simple splinegons
- Line arrangements and range search
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
- The shortest watchtower and related problems for polyhedral terrains
- Establishing order in planar subdivisions
- An algorithmic approach to some problems in terrain navigation
- Parallel construction of subdivision hierarchies
- Triangulating a simple polygon in linear time
- Deferred data structure for the nearest neighbor problem
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Finding effective ``Force targets for two-dimensional, multifinger frictional grips
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- Minimizing the sum of diameters efficiently
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- Implicitly representing arrangements of lines or segments
- Variable resolution triangulations
- An approximate algorithm for computing multidimensional convex hulls
- Semi-Lagrangian methods for level set equations
- A parallel algorithm for constructing projection polyhedra
- Computing a median point of a simple rectilinear polygon
- A workbench for computational geometry
- Efficient ray shooting and hidden surface removal
- Ray shooting in polygons using geodesic triangulations
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Rectilinear short path queries among rectangular obstacles
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- On fast planning of suboptimal paths amidst polygonal obstacles in plane
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Hierarchy of surface models and irreducible triangulations.
- Time-space trade-offs for triangulations and Voronoi diagrams
- Randomized approximation algorithms for planar visibility counting problem
- A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\)
- Geometric path problems with violations
- Stabbing circles for sets of segments in the plane
- Triangulating point sets in space
- Storing the subdivision of a polyhedral surface
- Reporting and counting segment intersections
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- On separating two simple polygons by a single translation
- Light edges in degree-constrained graphs
- Linear time approximation of 3D convex polytopes
- Efficient visibility queries in simple polygons
- I/O-efficient dynamic planar point location
- Expected asymptotically optimal planar point location
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Optimal cooperative search in fractional cascaded data structures
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- A multifacility location problem on median spaces
- A fast algorithm for point-location in a finite element mesh
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Computing the \(k\)-visibility region of a point in a polygon
- Reverse shortest path problem in weighted unit-disk graphs
- Shortest paths among transient obstacles
- Faster goal-oriented shortest path search for bulk and incremental detailed routing
- Shortest paths in the plane with obstacle violations
- How to pack directed acyclic graphs into small blocks
- Visibility and ray shooting queries in polygonal domains
- Computing the visibility map of fat objects
- \(L_{1}\) shortest path queries in simple polygons
- Quickest visibility queries in polygonal domains
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
- Computing the intersection-depth to polyhedra
- Approximating points by a piecewise linear function
- A simple but effective improvement to the plumb-line algorithm
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Three problems about simple polygons
- Algorithms for bivariate zonoid depth
- On polyhedra induced by point sets in space
- Query point visibility computation in polygons with holes
- Query-point visibility constrained shortest paths in simple polygons
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Locating two obnoxious facilities using the weighted maximin criterion
- Practical distribution-sensitive point location in triangulations
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
- Distance-sensitive planar point location
- Succinct and Implicit Data Structures for Computational Geometry
- WALKING IN A TRIANGULATION
- Computing largest empty circles with location constraints
- Pareto envelopes in simple polygons
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
- Spanning trees with low crossing number
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
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)
