Optimal Point Location in a Monotone Subdivision
From MaRDI portal
Publication:3738618
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)- Improved algorithms for the farthest colored Voronoi diagram of segments
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Computing the smallest k-enclosing circle and related problems
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Dynamic Trees and Dynamic Point Location
- Solving related two- and three-dimensional linear programming problems in logarithmic time
- Locating two obnoxious facilities using the weighted maximin criterion
- Storing the subdivision of a polyhedral surface
- An algorithm for generalized point location and its applications
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- Compressing spatio-temporal trajectories
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Optimal randomized parallel algorithms for computational geometry
- Farthest-point queries with geometric and combinatorial constraints
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- Optimal shortest path queries in a simple polygon
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- Dynamic connectivity in disk graphs
- Farthest-polygon Voronoi diagrams
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS
- Geometric complexity of some location problems
- Fractional cascading. I: A data structuring technique
- Finding effective ``Force targets for two-dimensional, multifinger frictional grips
- Reasoning about visibility
- Extremal polygon containment problems
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Rectilinear short path queries among rectangular obstacles
- Shortest paths among transient obstacles
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- Generalized Delaunay triangulation for planar graphs
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Computing the smallest \(k\)-enclosing circle and related problems
- Tetrahedrizing point sets in three dimensions
- Establishing order in planar subdivisions
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
- Dynamic maintenance of planar digraphs, with applications
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Abstract Voronoi diagrams from closed bisecting curves
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- ON GEOMETRIC PATH QUERY PROBLEMS
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Finding pairwise intersections inside a query range
- Computing the optimal bridge between two convex polygons
- Using geometry to solve the transportation problem in the plane
- Linear space data structures for two types of range search
- Spanning trees crossing few barriers
- A new algorithm for shortest paths among obstacles in the plane
- Algorithms for subpath convex hull queries and ray-shooting among segments
- On condorcet and median points of simple rectilinear polygons
- Implicitly representing arrangements of lines or segments
- The complexity and construction of many faces in arrangements of lines and of segments
- A time-optimal parallel algorithm for three-dimensional convex hulls
- Dilation-optimal edge deletion in polygonal cycles
- A sweepline algorithm for Voronoi diagrams
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Triangulating a simple polygon in linear time
- Stabbing circles for sets of segments in the plane
- Orthogonal point location and rectangle stabbing queries in 3-d
- On the line-separable unit-disk coverage and related problems
- Dog Bites Postman
- Quickest visibility queries in polygonal domains
- Optimal cooperative search in fractional cascaded data structures
- Ray shooting in polygons using geodesic triangulations
- Fast domino tileability
- Selecting distances in the plane
- Query-points visibility constraint minimum link paths in simple polygons
- New bounds for range closest-pair problems
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Dynamic fractional cascading
- Visibility and intersection problems in plane geometry
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS
- Topologically sweeping an arrangement
- Faster goal-oriented shortest path search for bulk and incremental detailed routing
- Star unfolding of a polytope with applications
- Moving a disc between polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Reverse shortest path problem in weighted unit-disk graphs
- Searching for the closest-pair in a query translate
- Shortest paths in the plane with obstacle violations
- Testing the necklace condition for shortest tours and optimal factors in the plane
- Computing a median point of a simple rectilinear polygon
- Adaptive planar point location
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- An incremental reconstruction method for dynamic planar point location
- Locating a robot with angle measurements
- A dual approach to detect polyhedral intersections in arbitrary dimensions
- Dynamic planar point location with optimal query time
- Succinct and Implicit Data Structures for Computational Geometry
- Faster goal-oriented shortest path search for bulk and incremental detailed routing
- New bounds for range closest-pair problems
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- An optimal algorithm for roundness determination on convex polygons
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)
