Pages that link to "Item:Q5361647"
From MaRDI portal
The following pages link to Proceedings of the twentieth annual symposium on Computational geometry (Q5361647):
Displayed 49 items.
- Geodesic ham-sandwich cuts (Q5361648) (← links)
- Separating point sets in polygonal environments (Q5361649) (← links)
- Approximate convex decomposition of polygons (Q5361650) (← links)
- Computing the visibility graph of points within a polygon (Q5361651) (← links)
- On lines avoiding unit balls in three dimensions (Q5361652) (← links)
- The number of lines tangent to arbitrary convex polyhedra in 3D (Q5361653) (← links)
- On distinct distances from a vertex of a convex polygon (Q5361654) (← links)
- Algorithms for center and Tverberg points (Q5361655) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q5361656) (← links)
- Solution of Scott's problem on the number of directions determined by a point set in 3-space (Q5361657) (← links)
- Continuous path verification in multi-axis NC-machining (Q5361659) (← links)
- Finding planar regions in a terrain (Q5361660) (← links)
- A scalable simulator for forest dynamics (Q5361662) (← links)
- Pushing squares around (Q5361663) (← links)
- New results on shortest paths in three dimensions (Q5361664) (← links)
- An energy-driven approach to linkage unfolding (Q5361665) (← links)
- Deterministic sampling and range counting in geometric data streams (Q5361666) (← links)
- Faster core-set constructions and data stream algorithms in fixed dimensions (Q5361667) (← links)
- Range counting over multidimensional data streams (Q5361668) (← links)
- An empirical comparison of techniques for updating Delaunay triangulations (Q5361669) (← links)
- A 2D kinetic triangulation with near-quadratic topological changes (Q5361670) (← links)
- Deformable spanners and applications (Q5361671) (← links)
- A computational framework for incremental motion (Q5361672) (← links)
- Counting and representing intersections among triangles in three dimensions (Q5361673) (← links)
- Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve (Q5361674) (← links)
- Binary space partitions of orthogonal subdivisions (Q5361675) (← links)
- Towards in-place geometric algorithms and data structures (Q5361676) (← links)
- A near-linear constant-factor approximation for euclidean bipartite matching? (Q5361677) (← links)
- Locality-sensitive hashing scheme based on p-stable distributions (Q5361678) (← links)
- Practical methods for shape fitting and kinetic data structures using core sets (Q5361679) (← links)
- On the least median square problem (Q5361680) (← links)
- Sampling and meshing a surface with guaranteed topology and geometry (Q5361681) (← links)
- Quality meshing for polyhedra with small angles (Q5361682) (← links)
- Spacetime meshing with adaptive refinement and coarsening (Q5361684) (← links)
- A bézier-based approach to unstructured moving meshes (Q5361685) (← links)
- Low-dimensional embedding with extra information (Q5361686) (← links)
- Provable surface reconstruction from noisy samples (Q5361687) (← links)
- The geometric thickness of low degree graphs (Q5361688) (← links)
- Computing persistent homology (Q5361689) (← links)
- Extreme elevation on a 2-manifold (Q5361690) (← links)
- Time-varying reeb graphs for continuous space-time data (Q5361691) (← links)
- On locally Delaunay geometric graphs (Q5361692) (← links)
- On the union of κ-round objects (Q5361693) (← links)
- On empty convex polygons in a planar point set (Q5361694) (← links)
- The criss-cross method can take Ω(n <sup>d</sup> ) pivots (Q5361695) (← links)
- Complete, exact, and efficient computations with cubic curves (Q5361696) (← links)
- Intersecting quadrics (Q5361697) (← links)
- Inner and outer rounding of set operations on lattice polygonal regions (Q5361698) (← links)
- Towards and open curved kernel (Q5361700) (← links)