Optimal Point Location in a Monotone Subdivision
From MaRDI portal
Recommendations
- Fully Dynamic Point Location in a Monotone Subdivision
- Point Location in Incremental Planar Subdivisions.
- Adaptive point location in planar convex subdivisions
- Adaptive Point Location in Planar Convex Subdivisions
- Optimal planar point location
- Point location in dynamic planar subdivisions
- DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
- scientific article; zbMATH DE number 1305387
- Dynamic Point Location in General Subdivisions
- scientific article; zbMATH DE number 742971
Cited in
(only showing first 100 items - show all)- The power of geometric duality revisited
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- Generalized Delaunay triangulation for planar graphs
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- Geometric complexity of some location problems
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- A sweepline algorithm for Voronoi diagrams
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Rectilinear shortest paths in the presence of rectangular barriers
- The shortest watchtower and related problems for polyhedral terrains
- Establishing order in planar subdivisions
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
- Topologically sweeping an arrangement
- Euclidean minimum spanning trees and bichromatic closest pairs
- Triangulating a simple polygon in linear time
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Searching for segments with largest relative overlap
- Optimal randomized parallel algorithms for computational geometry
- 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
- Output-sensitive generation of the perspective view of isothetic parallelepipeds
- Intersection queries in sets of disks
- Minimizing the sum of diameters efficiently
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Minimum-link paths among obstacles in the plane
- Point location in fat subdivisions
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- Testing the necklace condition for shortest tours and optimal factors in the plane
- Implicitly representing arrangements of lines or segments
- Fast tree-based redistancing for level set computations
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Computing a median point of a simple rectilinear polygon
- Computing the smallest k-enclosing circle and related problems
- Extremal polygon containment problems
- Ray shooting in polygons using geodesic triangulations
- Rectilinear short path queries among rectangular obstacles
- A new algorithm for shortest paths among obstacles in the plane
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Spanning trees crossing few barriers
- Stabbing circles for sets of segments in the plane
- Finding pairwise intersections inside a query range
- An exact geometry-based algorithm for path planning
- A near-linear algorithm for the planar segment-center problem
- Storing the subdivision of a polyhedral surface
- Optimal shortest path queries in a simple polygon
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- I/O-efficient dynamic planar point location
- Using geometry to solve the transportation problem in the plane
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Optimal cooperative search in fractional cascaded data structures
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- An optimal algorithm for roundness determination on convex polygons
- A multifacility location problem on median spaces
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- 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
- Reachable region query and its applications
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- \(L_{1}\) shortest path queries in simple polygons
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Quickest visibility queries in polygonal domains
- Selecting distances in the plane
- Computing the intersection-depth to polyhedra
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Farthest-point queries with geometric and combinatorial constraints
- Locating two obnoxious facilities using the weighted maximin criterion
- Tetrahedrizing point sets in three dimensions
- An algorithm for generalized point location and its applications
- New bounds for range closest-pair problems
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Succinct and Implicit Data Structures for Computational Geometry
- Improved implementation of point location in general two-dimensional subdivisions
- Computing the optimal bridge between two convex polygons
- Pareto envelopes in simple polygons
- Fast domino tileability
- Abstract Voronoi diagrams from closed bisecting curves
- scientific article; zbMATH DE number 3864520 (Why is no real title available?)
- PLANAR POINT LOCATION REVISITED
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Finding pairwise intersections inside a query range
- (Approximate) uncertain skylines
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- scientific article; zbMATH DE number 4090792 (Why is no real title available?)
- Improved algorithms for the farthest colored Voronoi diagram of segments
- Reasoning about visibility
- Dynamic Trees and Dynamic Point Location
- scientific article; zbMATH DE number 1182923 (Why is no real title available?)
- Dog Bites Postman
- ON GEOMETRIC PATH QUERY PROBLEMS
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
This page was built for publication: Optimal Point Location in a Monotone Subdivision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738618)
