Pages that link to "Item:Q5404400"
From MaRDI portal
The following pages link to Proceedings of the twenty-seventh annual symposium on Computational geometry (Q5404400):
Displayed 50 items.
- Deconstructing approximate offsets (Q1930550) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- Orthogonal range searching on the RAM, revisited (Q5404401) (← links)
- Convex hull of imprecise points in <i>o(n log n)</i> time after preprocessing (Q5404402) (← links)
- A static optimality transformation with applications to planar point location (Q5404403) (← links)
- Three problems about dynamic convex hulls (Q5404404) (← links)
- Metric graph reconstruction from noisy data (Q5404405) (← links)
- Comparing distributions and shapes using the kernel distance (Q5404407) (← links)
- Witnessed k-distance (Q5404408) (← links)
- Stochastic minimum spanning trees in euclidean spaces (Q5404409) (← links)
- Can they cross? and how? (Q5404410) (← links)
- Exploiting temporal coherence in forest dynamics simulation (Q5404411) (← links)
- Compressive sensing with local geometric features (Q5404412) (← links)
- Persistence-based clustering in riemannian manifolds (Q5404413) (← links)
- A kuratowski-type theorem for planarity of partially embedded graphs (Q5404414) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q5404416) (← links)
- Disjoint compatible geometric matchings (Q5404417) (← links)
- The least spanning area of a knot and the optimal bounding chain problem (Q5404418) (← links)
- The pachner graph and the simplification of 3-sphere triangulations (Q5404420) (← links)
- Space crossing numbers (Q5404421) (← links)
- Theoretical and practical results on straight skeletons of planar straight-line graphs (Q5404422) (← links)
- A generic algebraic kernel for non-linear geometric applications (Q5404423) (← links)
- Stable snap rounding (Q5404425) (← links)
- An output-sensitive algorithm for persistent homology (Q5404426) (← links)
- Zigzag persistent homology in matrix multiplication time (Q5404427) (← links)
- Reeb graphs (Q5404428) (← links)
- Shortest non-trivial cycles in directed surface graphs (Q5404429) (← links)
- Kinetic convex hulls and delaunay triangulations in the black-box model (Q5404430) (← links)
- The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites (Q5404431) (← links)
- Improved upper bound on the stretch factor of delaunay triangulations (Q5404432) (← links)
- Delaunay triangulations of point sets in closed euclidean d-manifolds (Q5404433) (← links)
- Redelmeier's algorithm for counting lattice animals (Q5404434) (← links)
- Geometric computation with smart pixels (Q5404436) (← links)
- Ant-sweep (Q5404437) (← links)
- Visualization of discrete gradient construction (Q5404438) (← links)
- Fitting spheres to electron density (Q5404439) (← links)
- Minimum perimeter convex hull of imprecise points in convex regions (Q5404440) (← links)
- A pedagogic JavaScript program for point location strategies (Q5404441) (← links)
- Answering geographic questions with user generated content (Q5404442) (← links)
- Integer representations of convex polygon intersection graphs (Q5404443) (← links)
- Sphere and dot product representations of graphs (Q5404444) (← links)
- Contact representations of planar graphs with cubes (Q5404445) (← links)
- Beating the spread (Q5404446) (← links)
- Edge flips and deforming surface meshes (Q5404447) (← links)
- Kinetic mesh refinement in 2D (Q5404448) (← links)
- Minors in random and expanding hypergraphs (Q5404449) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q5404450) (← links)
- On the structure and composition of forbidden sequences, with geometric applications (Q5404451) (← links)
- A new upper bound for the VC-dimension of visibility regions (Q5404452) (← links)
- Guarding polyominoes (Q5404453) (← links)