Pages that link to "Item:Q5370692"
From MaRDI portal
The following pages link to Proceedings of the twenty-fifth annual symposium on Computational geometry (Q5370692):
Displayed 44 items.
- Lower bounds for weak epsilon-nets and stair-convexity (Q532609) (← links)
- Epsilon nets and union complexity (Q5370694) (← links)
- PTAS for geometric hitting set problems via local search (Q5370695) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q5370696) (← links)
- Coresets for polytope distance (Q5370697) (← links)
- Kinetic spanners in R <sup>d</sup> (Q5370698) (← links)
- Shooting permanent rays among disjoint polygons in the plane (Q5370699) (← links)
- Computing hereditary convex structures (Q5370700) (← links)
- Binary plane partitions for disjoint line segments (Q5370701) (← links)
- Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection (Q5370702) (← links)
- The scale axis transform (Q5370703) (← links)
- Integral estimation from point cloud in d-dimensional space (Q5370705) (← links)
- Cut locus and topology from surface point data (Q5370707) (← links)
- An improved bound on the number of unit area triangles (Q5370708) (← links)
- Halving lines and measure concentration in the plane (Q5370709) (← links)
- Candle in the woods (Q5370712) (← links)
- Approximate center points with proofs (Q5370713) (← links)
- Visibility maps of realistic terrains have linear smoothed complexity (Q5370714) (← links)
- Embedding rivers in polyhedral terrains (Q5370715) (← links)
- The Euclidean degree-4 minimum spanning tree problem is NP-hard (Q5370716) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q5370717) (← links)
- The geodesic farthest-site Voronoi diagram in a polygonal domain with holes (Q5370718) (← links)
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension (Q5370719) (← links)
- Parallel geometric algorithms for multi-core computers (Q5370720) (← links)
- Persistent cohomology and circular coordinates (Q5370721) (← links)
- Proximity of persistence modules and their diagrams (Q5370722) (← links)
- Zigzag persistent homology and real-valued functions (Q5370723) (← links)
- Distributed vision with smart pixels (Q5370725) (← links)
- Area-universal rectangular layouts (Q5370726) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q5370727) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q5370728) (← links)
- A proof of the molecular conjecture (Q5370729) (← links)
- Flattening single-vertex origami (Q5370730) (← links)
- Arrangements of double pseudolines (Q5370731) (← links)
- k-means requires exponentially many iterations even in the plane (Q5370732) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
- On the set multi-cover problem in geometric settings (Q5370734) (← links)
- Adaptive isotopic approximation of nonsingular curves (Q5370735) (← links)
- On the topology of planar algebraic curves (Q5370736) (← links)
- Randomly removing g handles at once (Q5370737) (← links)
- Minimum cuts and shortest homologous cycles (Q5370738) (← links)
- Diameter of polyhedra (Q5370739) (← links)
- Minimum Manhattan network is NP-complete (Q5370740) (← links)
- On grids in topological graphs (Q5370741) (← links)