The following pages link to Computational Geometry (Q175378):
Displaying 50 items.
- Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics (Q265715) (← links)
- A lower bound for computing geometric spanners (Q265718) (← links)
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Geometric permutations of non-overlapping unit balls revisited (Q265727) (← links)
- On optimal disc covers and a new characterization of the Steiner center (Q283866) (← links)
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Edge routing with ordered bundles (Q283873) (← links)
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Faster geometric algorithms via dynamic determinant computation (Q283878) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Covering points with minimum/maximum area orthogonally convex polygons (Q283887) (← links)
- Metric embedding, hyperbolic space, and social networks (Q340518) (← links)
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem (Q340521) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Multivariate topology simplification (Q340525) (← links)
- Drawing graphs with vertices and edges in convex position (Q340526) (← links)
- Probing convex polygons with a wedge (Q340529) (← links)
- Affine invariants of generalized polygons and matching under affine transformations (Q340532) (← links)
- Efficient and robust persistent homology for measures (Q340536) (← links)
- Polygon guarding with orientation (Q340539) (← links)
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743) (← links)
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- On inducing polygons and related problems (Q359751) (← links)
- On the number of crossing-free partitions (Q359753) (← links)
- Witness Gabriel graphs (Q359756) (← links)
- Symmetric connectivity with directional antennas (Q364844) (← links)
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- Separating families of convex sets (Q364852) (← links)
- Approximating majority depth (Q364853) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) (Q390105) (← links)
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- Development of curves on polyhedra via conical existence (Q390109) (← links)
- A Fourier-theoretic approach for inferring symmetries (Q390110) (← links)
- Enumerating topological \((n_k)\)-configurations (Q390112) (← links)
- Making triangulations 4-connected using flips (Q390117) (← links)
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Convex transversals (Q390129) (← links)
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (Q390131) (← links)
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Improved algorithms to network \(p\)-center location problems (Q390143) (← links)
