Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 339
Jack Scott Snoeyink - MaRDI portal

Jack Scott Snoeyink

From MaRDI portal
(Redirected from Person:223967)
Person:170480

Available identifiers

zbMath Open snoeyink.jack-scottDBLPs/JackSnoeyinkWikidataQ37392413 ScholiaQ37392413MaRDI QIDQ170480

List of research outcomes

PublicationDate of PublicationType
Finding the medial axis of a simple polygon in linear time2023-03-21Paper
Counting and reporting red/blue segment intersections2023-01-18Paper
Computing common tangents without a separating line2022-12-16Paper
Input-sensitive compliant motion in the plane2022-12-09Paper
Two- and three- dimensional point location in rectangular subdivisions2022-12-09Paper
Convex polygons made from few lines and convex decompositions of polyhedra2022-12-09Paper
Cartographic line simplication and polygon CSG formulae in O(n log* n) time2022-08-19Paper
Linear-time reconstruction of Delaunay triangulations with applications2021-12-20Paper
Computation of spatial skyline points2021-01-07Paper
Implementing streaming simplification for large labeled meshes2019-09-11Paper
Testing Homotopy for paths in the plane2018-11-23Paper
Interlocked open linkages with few joints2018-11-23Paper
Bumpy pyramid folding2018-10-31Paper
Visibility graphs, dismantlability, and the cops and robbers game2018-02-12Paper
Kinetic collision detection for simple polygons2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q55012872015-08-03Paper
Computing planar Voronoi diagrams in double precision2014-04-03Paper
Fitting spheres to electron density2014-03-24Paper
Number of Crossing-Free Geometric Graphs vs. Triangulations2013-06-28Paper
Reconstructing polygons from scanner data2011-07-27Paper
Degree-Driven Design for Correct Geometric Algorithms2011-06-03Paper
Lossless compression of predicted floating-point geometry2011-03-04Paper
Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)2011-01-31Paper
Capturing crossings: convex hulls of segment and plane intersections2010-04-19Paper
Computation of Non-dominated Points Using Compact Voronoi Diagrams2010-02-09Paper
Reconstructing Polygons from Scanner Data2009-12-17Paper
Isocontour based Visualization of Time-varying Scalar Fields2009-12-11Paper
Delaunay triangulation of imprecise points in linear time after preprocessing2009-11-16Paper
Computing the Implicit Voronoi Diagram in Triple Precision2009-10-20Paper
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree2009-10-16Paper
Representing Interpolant Topology for Contour Tree Computation2009-05-20Paper
How long can a graph be kept planar?2009-04-07Paper
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams2009-02-12Paper
Delaunay triangulations of imprecise pointsin linear time after preprocessing2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015172009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q36015792009-02-10Paper
FARAWAY POINT: A SENTINEL POINT FOR DELAUNAY COMPUTATION2008-09-29Paper
Time-varying Reeb graphs for continuous space-time data2008-09-19Paper
Efficient algorithms for maximum regression depth2008-08-19Paper
Faster placement of hydrogens in protein structures by dynamic programming2008-06-20Paper
Delineating boundaries for imprecise regions2008-04-03Paper
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL2007-07-04Paper
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm2007-06-26Paper
Maximum independent set for intervals by divide and conquer with pruning2007-03-30Paper
https://portal.mardi4nfdi.de/entity/Q52902712006-04-28Paper
THE REFLEX-FREE HULL2005-12-09Paper
Polygonal path simplification with angle constraints2005-11-01Paper
A lower bound for multicast key distribution2005-02-09Paper
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS2004-09-29Paper
ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS2004-09-29Paper
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree2004-09-22Paper
Testing homotopy for paths in the plane2004-03-11Paper
Spanning trees crossing few barriers2004-02-05Paper
Interlocked open and closed linkages with few joints.2003-07-01Paper
Spirale reversi: Reverse decoding of the edgebreaker encoding2003-06-03Paper
Tight degree bounds for pseudo-triangulations of points2003-05-19Paper
The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra2003-05-19Paper
Compressing the Property Mapping of Polygon Meshes2003-05-14Paper
Computing contour trees in all dimensions2003-04-28Paper
The size of spanning disks for polygonal curves2003-03-17Paper
Some aperture-angle optimization problems2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q45478132002-08-21Paper
Efficiently approximating polygonal paths in three and higher dimensions2002-06-17Paper
https://portal.mardi4nfdi.de/entity/Q27683182002-01-30Paper
Generalizing ham sandwich cuts to equitable subdivisions2001-08-16Paper
https://portal.mardi4nfdi.de/entity/Q27219932001-07-11Paper
Efficient algorithms for line and curve segment intersection using restricted predicates2001-04-09Paper
On exclusion regions for optimal triangulations2001-04-04Paper
https://portal.mardi4nfdi.de/entity/Q47618612001-02-21Paper
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME2000-11-07Paper
Queries with segments in Voronoi diagrams2000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49527182000-05-10Paper
Removing degeneracies by perturbing the problem or perturbing the world2000-03-22Paper
Cross-ratios and angles determine a polygon1999-11-25Paper
https://portal.mardi4nfdi.de/entity/Q42522801999-06-17Paper
Finding the medial axis of a simple polygon in linear time1999-05-27Paper
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time1999-05-03Paper
https://portal.mardi4nfdi.de/entity/Q44010201999-03-02Paper
Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time1999-02-02Paper
Fitting a set of points by a circle1998-12-02Paper
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams1998-07-27Paper
Erased arrangements of linear and convex decompositions of polyhedra1998-04-13Paper
Optimal Algorithms to Embed Trees in a Point Set1998-04-01Paper
Generating random polygons with given vertices1997-03-03Paper
Efficiently Planning Compliant Motion in the Plane1996-11-26Paper
Folding rulers inside triangles1996-09-22Paper
https://portal.mardi4nfdi.de/entity/Q48860581996-08-22Paper
Point location in zones of \(k\)-flats in arrangements1996-07-14Paper
A compact piecewise-linear Voronoi diagram for convex sites in the plane1996-02-13Paper
Objects that cannot be taken apart with two hands1995-05-29Paper
https://portal.mardi4nfdi.de/entity/Q43273731995-04-05Paper
MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES1995-01-26Paper
APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS1995-01-02Paper
https://portal.mardi4nfdi.de/entity/Q31388901994-09-19Paper
An optimal algorithm for the on-line closest-pair problem1994-08-10Paper
Efficient ray shooting and hidden surface removal1994-08-10Paper
Ray shooting in polygons using geodesic triangulations1994-08-10Paper
Computing minimum length paths of a given homotopy class1994-07-21Paper
Computing a Face in an Arrangement of Line Segments and Related Problems1994-02-24Paper
https://portal.mardi4nfdi.de/entity/Q31389811993-10-20Paper
An efficient algorithm for finding the CSG representation of a simple polygon1993-09-01Paper
Stabbing parallel segments with a convex polygon1993-08-24Paper
https://portal.mardi4nfdi.de/entity/Q40366021993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374301993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40288891993-03-28Paper
Counting and cutting cycles of lines and rods in space1992-09-27Paper
COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS1991-01-01Paper
On arrangements of Jordan arcs with three intersections per pair1989-01-01Paper
Implicitly representing arrangements of lines or segments1989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jack Scott Snoeyink