Pages that link to "Item:Q3738618"
From MaRDI portal
The following pages link to Optimal Point Location in a Monotone Subdivision (Q3738618):
Displayed 50 items.
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Fast tree-based redistancing for level set computations (Q1302930) (← links)
- Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
- Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- An exact geometry-based algorithm for path planning (Q1797878) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Using geometry to solve the transportation problem in the plane (Q1894300) (← links)
- A time-optimal parallel algorithm for three-dimensional convex hulls (Q1899449) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- An optimal algorithm for roundness determination on convex polygons (Q1917034) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Reverse shortest path problem in weighted unit-disk graphs (Q2154091) (← links)
- Shortest paths among transient obstacles (Q2156288) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q2164671) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Reachable region query and its applications (Q2201650) (← links)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- An algorithm for generalized point location and its applications (Q2639635) (← links)