The following pages link to Jack Scott Snoeyink (Q170480):
Displaying 50 items.
- (Q223967) (redirect page) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) (Q621930) (← links)
- Lossless compression of predicted floating-point geometry (Q628132) (← links)
- A lower bound for multicast key distribution (Q707165) (← links)
- Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree (Q733556) (← links)
- Linear-time reconstruction of Delaunay triangulations with applications (Q826118) (← links)
- Computation of spatial skyline points (Q827323) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Time-varying Reeb graphs for continuous space-time data (Q945940) (← links)
- Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
- How long can a graph be kept planar? (Q1010669) (← 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)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- On arrangements of Jordan arcs with three intersections per pair (Q1262864) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Fitting a set of points by a circle (Q1272963) (← links)
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time (Q1276944) (← links)
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472) (← links)
- Finding the medial axis of a simple polygon in linear time (Q1289244) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- Objects that cannot be taken apart with two hands (Q1338963) (← links)
- (Q1380807) (redirect page) (← links)
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams (Q1380808) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Interlocked open and closed linkages with few joints. (Q1395574) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Testing homotopy for paths in the plane (Q1424318) (← links)
- Queries with segments in Voronoi diagrams (Q1567303) (← links)
- Efficient algorithms for line and curve segment intersection using restricted predicates (Q1567304) (← links)
- Generalizing ham sandwich cuts to equitable subdivisions (Q1591052) (← links)
- Efficiently approximating polygonal paths in three and higher dimensions (Q1601006) (← links)
- Bumpy pyramid folding (Q1615921) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- Cross-ratios and angles determine a polygon (Q1809515) (← links)
- Some aperture-angle optimization problems (Q1849591) (← links)
- The size of spanning disks for polygonal curves (Q1864124) (← links)
- Computing contour trees in all dimensions (Q1869743) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra (Q1873157) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- Folding rulers inside triangles (Q1913598) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Removing degeneracies by perturbing the problem or perturbing the world (Q1971097) (← links)
