Pages that link to "Item:Q3967063"
From MaRDI portal
The following pages link to Optimal Search in Planar Subdivisions (Q3967063):
Displaying 50 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Decomposing the boundary of a nonconvex polyhedron (Q675296) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- On rectilinear link distance (Q808302) (← links)
- Closest-pair queries and minimum-weight queries are equivalent for squares (Q824331) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Range queries on uncertain data (Q897858) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Tight bounds for connecting sites across barriers (Q958235) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- Point set stratification and Delaunay depth (Q1019881) (← links)
- Rotationally monotone polygons (Q1025304) (← links)
- Clamshell casting (Q1031870) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- Computing circular separability (Q1079817) (← links)
- The power of geometric duality (Q1082821) (← links)
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Geometric complexity of some location problems (Q1099951) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- Line arrangements and range search (Q1107313) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- The shortest watchtower and related problems for polyhedral terrains (Q1114400) (← links)
