Pages that link to "Item:Q2874557"
From MaRDI portal
The following pages link to Proceedings of the twenty-eighth annual symposium on Computational geometry (Q2874557):
Displaying 36 items.
- On eigenvalues of random complexes (Q503252) (← links)
- On topological changes in the Delaunay triangulation of moving points (Q2391707) (← links)
- Linear-size approximations to the Vietoris-Rips filtration (Q2391709) (← links)
- Geometric packing under non-uniform constraints (Q2874559) (← links)
- Approximate bregman near neighbors in sublinear time (Q2874562) (← links)
- The point-set embeddability problem for plane graphs (Q2874563) (← links)
- Algorithmic complexity of finding cross-cycles in flag complexes (Q2874564) (← links)
- Counting crossing-free structures (Q2874565) (← links)
- A fast and simple surface reconstruction algorithm (Q2874567) (← links)
- Higher-order Erdös (Q2874570) (← links)
- Add isotropic Gaussian kernels at own risk (Q2874571) (← links)
- On the expected complexity of voronoi diagrams on terrains (Q2874572) (← links)
- On Klee's measure problem for grounded boxes (Q2874573) (← links)
- Testing graph isotopies on surfaces (Q2874574) (← links)
- Approximating low-dimensional coverage problems (Q2874577) (← links)
- Improved range searching lower bounds (Q2874579) (← links)
- An output-sensitive algorithm for computing projections of resultant polytopes (Q2874580) (← links)
- Counting plane graphs (Q2874581) (← links)
- Multinerves and helly numbers of acyclic families (Q2874582) (← links)
- Duals of orphan-free anisotropic voronoi diagrams are embedded meshes (Q2874583) (← links)
- Stability of Delaunay-type structures for manifolds (Q2874584) (← links)
- Alexander duality for functions (Q2874586) (← links)
- Certified computation of planar morse-smale complexes (Q2874587) (← links)
- A deterministic <i>o(m log m)</i> time algorithm for the reeb graph (Q2874588) (← links)
- Self-improving algorithms for coordinate-wise maxima (Q2874589) (← links)
- Finding the maximal empty disk containing a query point (Q2874590) (← links)
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set (Q2874591) (← links)
- Stabbing horizontal segments with vertical rays (Q2874592) (← links)
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model (Q2874593) (← links)
- A theorem of bárány revisited and extended (Q2874594) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2874595) (← links)
- Periodic body-and-bar frameworks (Q2874596) (← links)
- Optimal area-sensitive bounds for polytope approximation (Q2874597) (← links)
- Object-image correspondence for curves under central and parallel projections (Q2874598) (← links)
- Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions (Q2874600) (← links)
- The 2-page crossing number of K <sub>n</sub> (Q2874601) (← links)
