The following pages link to (Q3219753):
Displaying 50 items.
- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem (Q287251) (← links)
- Computing a poset from its realizer (Q287260) (← links)
- Efficient dynamic range searching using data replication (Q293421) (← links)
- Cellular tree classifiers (Q358883) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox (Q458475) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Metric trees (Q808798) (← links)
- Boundary labeling: Models and efficient algorithms for rectangular maps (Q868108) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Hidden line elimination for isooriented rectangles (Q911768) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Shortest paths in the plane with convex polygonal obstacles (Q1085615) (← links)
- On the dynamization of data structures (Q1095647) (← links)
- Translation separability of sets of polygons (Q1100897) (← links)
- A log log n data structure for three-sided range queries (Q1108025) (← links)
- On estimating the complexity of logarithmic decomposition (Q1116321) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- A special case the of dynamization problem for least cost paths (Q1183415) (← links)
- Satisfying general proximity/similarity queries with metric trees (Q1183466) (← links)
- Off-line dynamic maintenance of the width of a planar point set (Q1190292) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Probing a scene of nonconvex polyhedra (Q1194334) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900) (← links)
- Hashing lazy numbers (Q1340859) (← links)
- An algorithm to compute bounds for the star discrepancy (Q1347864) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
