Pages that link to "Item:Q3738618"

The following pages link to Optimal Point Location in a Monotone Subdivision (Q3738618):

Displaying 50 items.

• Computing the optimal bridge between two convex polygons (Q294636) (← links)
• Fast domino tileability (Q312152) (← links)
• Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
• (Approximate) uncertain skylines (Q359874) (← links)
• Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
• Reasoning about visibility (Q420853) (← links)
• Linear space data structures for two types of range search (Q578916) (← links)
• The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
• Farthest-polygon Voronoi diagrams (Q632728) (← links)
• Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
• Moving a disc between polygons (Q749237) (← links)
• An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
• Locating a robot with angle measurements (Q751327) (← links)
• A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
• On rectilinear link distance (Q808302) (← links)
• Compressing spatio-temporal trajectories (Q833705) (← links)
• Range queries on uncertain data (Q897858) (← links)
• Dynamic fractional cascading (Q908708) (← links)
• Visibility and intersection problems in plane geometry (Q910213) (← links)
• Computational geometry in a curved world (Q911324) (← links)
• Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
• Triangulating a nonconvex polytope (Q914375) (← links)
• Dynamic planar point location with optimal query time (Q914389) (← links)
• Partitioning arrangements of lines. II: Applications (Q921915) (← links)
• Tight bounds for connecting sites across barriers (Q958235) (← links)
• Fast computation of smallest enclosing circle with center on a query line segment (Q975487) (← links)
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← 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)
• Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
• Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
• Geometric complexity of some location problems (Q1099951) (← links)
• Fractional cascading. I: A data structuring technique (Q1099957) (← links)
• Fractional cascading. II: Applications (Q1099958) (← links)
• A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
• Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
• The shortest watchtower and related problems for polyhedral terrains (Q1114400) (← links)
• Establishing order in planar subdivisions (Q1115185) (← links)
• A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency (Q1115624) (← links)
• Topologically sweeping an arrangement (Q1122981) (← links)
• Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
• Triangulating a simple polygon in linear time (Q1176324) (← links)
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
• Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
• Searching for segments with largest relative overlap (Q1186585) (← links)
• Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
• Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
• \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)