The following pages link to Jack Scott Snoeyink (Q170480):
Displaying 18 items.
- Reconstructing polygons from scanner data (Q553352) (← links)
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree (Q733556) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Testing homotopy for paths in the plane (Q1424318) (← links)
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra (Q1873157) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL (Q2371333) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- Degree-Driven Design for Correct Geometric Algorithms (Q3004650) (← links)
- Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams (Q3602871) (← links)
- Computing planar Voronoi diagrams in double precision (Q5405905) (← links)
- Spirale reversi: Reverse decoding of the edgebreaker encoding (Q5952970) (← links)
- Finding the medial axis of a simple polygon in linear time (Q6487986) (← links)
