The following pages link to (Q3772828):
Displayed 50 items.
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Proximate point searching (Q598552) (← links)
- The legacy of automatic mesh generation from solid modeling (Q672240) (← links)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere (Q672249) (← links)
- Why is the 3D Delaunay triangulation difficult to construct? (Q673008) (← links)
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions (Q673501) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- \(\varepsilon\)-approximations of \(k\)-label spaces (Q674408) (← links)
- Fast randomized parallel methods for planar convex hull construction (Q676065) (← links)
- On intersecting a point set with Euclidean balls (Q676066) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Towards exact geometric computation (Q676577) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218) (← links)
- The power of parallel projection (Q685515) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Antipodal graphs and oriented matroids (Q686471) (← links)
- Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- The combinatorial structure of random polytopes (Q705993) (← links)
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993) (← links)
- Constructions and complexity of secondary polytopes (Q750909) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Construction of Voronoi diagrams in the plane by using maps (Q751861) (← links)
- Computing a sweeping-plane in regular (``general'') position: A numerical and a symbolic solution (Q751863) (← links)
- An acyclicity theorem for cell complexes in d dimensions (Q756134) (← links)
- Variations on the theme of repeated distances (Q756139) (← links)
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces (Q757098) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- Order-k Voronoi diagrams of sites with additive weights in the plane (Q802900) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Dynamic partition trees (Q804289) (← links)
- Using Gale transforms in computational geometry (Q805285) (← links)
- Construction of three-dimensional Delaunay triangulations using local transformations (Q807005) (← links)
- A new representation of orientable 2-manifold polygonal surfaces for geometric modelling (Q863841) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Risk bounds for statistical learning (Q869973) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)