The following pages link to Jack Scott Snoeyink (Q170480):
Displaying 50 items.
- Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL (Q2371333) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- (Q2721993) (← links)
- (Q2768318) (← links)
- Degree-Driven Design for Correct Geometric Algorithms (Q3004650) (← links)
- (Q3138890) (← links)
- (Q3138981) (← links)
- Computing the Implicit Voronoi Diagram in Triple Precision (Q3183479) (← links)
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS (Q3212329) (← links)
- Computation of Non-dominated Points Using Compact Voronoi Diagrams (Q3404431) (← links)
- Maximum independent set for intervals by divide and conquer with pruning (Q3428912) (← links)
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm (Q3446815) (← links)
- Faster placement of hydrogens in protein structures by dynamic programming (Q3507790) (← links)
- FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION (Q3527439) (← links)
- (Q3601517) (← links)
- (Q3601579) (← links)
- Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams (Q3602871) (← links)
- Delaunay triangulations of imprecise pointsin linear time after preprocessing (Q3602931) (← links)
- Representing Interpolant Topology for Contour Tree Computation (Q3628680) (← links)
- Isocontour based Visualization of Time-varying Scalar Fields (Q3651655) (← links)
- Reconstructing Polygons from Scanner Data (Q3652273) (← links)
- (Q4028889) (← links)
- (Q4036602) (← links)
- (Q4037430) (← links)
- (Q4252280) (← links)
- Computing a Face in an Arrangement of Line Segments and Related Problems (Q4277544) (← links)
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS (Q4289634) (← links)
- MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES (Q4292528) (← links)
- (Q4327373) (← links)
- Optimal Algorithms to Embed Trees in a Point Set (Q4381059) (← links)
- (Q4401020) (← links)
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231) (← links)
- (Q4547813) (← links)
- Testing Homotopy for paths in the plane (Q4557551) (← links)
- Interlocked open linkages with few joints (Q4557554) (← links)
- (Q4761861) (← links)
- Compressing the Property Mapping of Polygon Meshes (Q4806645) (← links)
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS (Q4818544) (← links)
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554) (← links)
- (Q4886058) (← links)
- Efficiently Planning Compliant Motion in the Plane (Q4887018) (← links)
- (Q4952718) (← links)
- Input-sensitive compliant motion in the plane (Q5056106) (← links)
- Two- and three- dimensional point location in rectangular subdivisions (Q5056154) (← links)
- Convex polygons made from few lines and convex decompositions of polyhedra (Q5056156) (← links)
- Computing common tangents without a separating line (Q5057432) (← links)
- Counting and reporting red/blue segment intersections (Q5060144) (← links)
- Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928) (← links)
- Implementing streaming simplification for large labeled meshes (Q5233608) (← links)