Pages that link to "Item:Q5361551"
From MaRDI portal
The following pages link to Proceedings of the seventeenth annual symposium on Computational geometry (Q5361551):
Displaying 39 items.
- On the number of congruent simplices in a point (Q5361552) (← links)
- Enumerating order types for small sets with applications (Q5361553) (← links)
- The union of congruent cubes in three dimensions (Q5361554) (← links)
- On the distinct distances determined by a planar point set (Q5361555) (← links)
- Schematization of road networks (Q5361556) (← links)
- Simplifying a polygonal subdivision while keeping it simple (Q5361557) (← links)
- Hardware-assisted view-dependent map simplification (Q5361559) (← links)
- Efficient perspective-accurate silhouette computation and applications (Q5361560) (← links)
- Hierarchical morse complexes for piecewise linear 2-manifolds (Q5361561) (← links)
- Computing a canonical polygonal schema of an orientable triangulated surface (Q5361562) (← links)
- Area-preserving piecewise affine mappings (Q5361563) (← links)
- Nice point sets can have nasty Delaunay triangulations (Q5361564) (← links)
- Walking in a triangulation (Q5361565) (← links)
- Sink-insertion for mesh improvement (Q5361566) (← links)
- Box-trees and R-trees with near-optimal query time (Q5361567) (← links)
- A segment-tree based kinetic BSP (Q5361568) (← links)
- Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles (Q5361570) (← links)
- A note on binary plane partitions (Q5361571) (← links)
- Exact L <sub>∞</sub> nearest neighbor search in high dimensions (Q5361572) (← links)
- Farthest neighbors and center points in the presence of rectngular obstacles (Q5361573) (← links)
- A fully dynamic algorithm for planar (Q5361574) (← links)
- A practical approach for computing the diameter of a point set (Q5361575) (← links)
- Discrete mobile centers (Q5361576) (← links)
- Segment intersection searching problems in general settings (Q5361577) (← links)
- On the complexity of halfspace area queries (Q5361578) (← links)
- Algorithms for congruent sphere packing and applications (Q5361579) (← links)
- Polymake: an approach to modular software design in computational geometry (Q5361580) (← links)
- A randomized art-gallery algorithm for sensor placement (Q5361582) (← links)
- Notes on computing peaks in k-levels and parametric spanning trees (Q5361583) (← links)
- A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$} (Q5361584) (← links)
- The Clarkson-Shor technique revisited and extended (Q5361585) (← links)
- Detecting undersampling in surface reconstruction (Q5361586) (← links)
- Computing a 3-dimensional cell in an arrangement of quadrics (Q5361588) (← links)
- PRECISE (Q5361589) (← links)
- Different bounds on the different Betti numbers of semi-algebraic sets (Q5361590) (← links)
- Efficient and small representation of line arrangements with applications (Q5361591) (← links)
- A sum of squares theorem for visibility (Q5361593) (← links)
- Monotone paths in line arrangement (Q5361595) (← links)
- Balanced lines, halving triangles, and the generalized lower bound theorem (Q5361596) (← links)
