The following pages link to Jack Snoeyink (Q170480):
Displaying 12 items.
- Stabbing parallel segments with a convex polygon (Q5289812) (← links)
- (Q5290271) (← links)
- Number of Crossing-Free Geometric Graphs vs. Triangulations (Q5301006) (← links)
- Kinetic collision detection for simple polygons (Q5361544) (← links)
- Fitting spheres to electron density (Q5404439) (← links)
- Computing planar Voronoi diagrams in double precision (Q5405905) (← links)
- (Q5501287) (← links)
- THE REFLEX-FREE HULL (Q5711096) (← links)
- On exclusion regions for optimal triangulations (Q5929321) (← links)
- A one-step crust and skeleton extraction algorithm (Q5945906) (← links)
- Spirale reversi: Reverse decoding of the edgebreaker encoding (Q5952970) (← links)
- Finding the medial axis of a simple polygon in linear time (Q6487986) (← links)