Pages that link to "Item:Q3738618"
From MaRDI portal
The following pages link to Optimal Point Location in a Monotone Subdivision (Q3738618):
Displayed 33 items.
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS (Q4682199) (← links)
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE (Q4818563) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- (Q5002701) (← links)
- Adaptive Planar Point Location (Q5009786) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
- Output-sensitive generation of the perspective view of isothetic parallelepipeds (Q5056093) (← links)
- Input-sensitive compliant motion in the plane (Q5056106) (← links)
- Star unfolding of a polytope with applications (Q5056108) (← links)
- Intersection queries in sets of disks (Q5056120) (← links)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- An optimal algorithm for roundness determination on convex polygons (Q5060152) (← links)
- Searching for the closest-pair in a query translate (Q5088994) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup> (Q5108270) (← links)
- (Q5111738) (← links)
- (Q5115770) (← links)
- (Q5116518) (← links)
- New Bounds for Range Closest-Pair Problems (Q5116533) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS (Q5696904) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- External memory planar point location with logarithmic updates (Q5920252) (← links)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315) (← links)
- A fast semi-Lagrangian contouring method for moving interfaces (Q5943993) (← links)
- Space-efficient functional offline-partially-persistent trees with applications to planar point location (Q6139049) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)