Jack Snoeyink
According to our database^{1},
Jack Snoeyink
authored at least 196 papers
between 1988 and 2016.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2016
Creating a robust implementation for segment intersection by refinement: A multistage assignment that defines away degeneracies.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
On the Precision to Sort LineQuadric Intersections.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2014
Frontiers in algorithmics.
Theor. Comput. Sci., 2014
Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with DegreeDriven Analysis, pp. 280.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Visibility Graphs, Dismantlability, and the Cops and Robbers Game.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Decontaminating Planar Regions by Sweeping with Barrier Curves.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Bumpy Pyramid Folding.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Covering Folded Shapes.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Computing the Nearest Neighbor Transform Exactly with Only Double Precision.
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012
2011
Almost all Delaunay triangulations have stretch factor greater than pi/2.
Comput. Geom., 2011
Fitting spheres to electron density.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011
On the energy of bifurcated hydrogen bonds for protein structure prediction.
Proceedings of the 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2011
DegreeDriven Design for Correct Geometric Algorithms.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011
2010
Functional neighbors: inferring relationships between nonhomologous protein families using familyspecific packing motifs.
IEEE Trans. Information Technology in Biomedicine, 2010
Delaunay triangulation of imprecise points in linear time after preprocessing.
Comput. Geom., 2010
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree.
Comput. Geom., 2010
Computation of Nondominated Points Using Compact Voronoi Diagrams.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
Computing planar Voronoi diagrams in double precision: a further example of degreedriven algorithm design.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
Maximum geodesic routing in the plane with obstacles.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Implementing Streaming Simplification for large Labeled Meshes.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010
2009
Identification of familyspecific residue packing motifs and their use for structurebased protein function prediction: II. Case studies and applications.
Journal of ComputerAided Molecular Design, 2009
Identification of familyspecific residue packing motifs and their use for structurebased protein function prediction: I. Method development.
Journal of ComputerAided Molecular Design, 2009
Computing the Implicit Voronoi Diagram in Triple Precision.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Centralized path planning for multiple robots: Optimal decoupling into sequential plans.
Proceedings of the Robotics: Science and Systems V, University of Washington, Seattle, USA, June 28, 2009
Reconstructing Polygons from Scanner Data.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Reducing the memory required to find a geodesic shortest path on a large mesh.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009
Defining and computing accessibility radius.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
The spanning ratio of the Delaunay triangulation is greater than pi/2.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
2008
Defining and Computing Optimum RMSD for Gapped and Weighted MultipleStructure Alignment.
IEEE/ACM Trans. Comput. Biology Bioinform., 2008
Faraway Point: a Sentinel Point for Delaunay Computation.
Int. J. Comput. Geometry Appl., 2008
Number of CrossingFree Geometric Graphs vs. Triangulations.
Electronic Notes in Discrete Mathematics, 2008
Timevarying Reeb graphs for continuous spacetime data.
Comput. Geom., 2008
How Long Can a Graph be Kept Planar?
Electr. J. Comb., 2008
Delineating Boundaries for Imprecise Regions.
Algorithmica, 2008
Biogeometry: challenges, approaches, and future opportunities in proteomics and drug discovery.
Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 2008
OntheFly Rotamer Pair Energy Evaluation in Protein Design.
Proceedings of the Bioinformatics Research and Applications, 2008
Delaunay triangulations of imprecise pointsin linear time after preprocessing.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
Functional Neighbors: Inferring Relationships between NonHomologous Protein Families Using FamilySpecific Packing Motifs.
Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine, 2008
2007
Maximum independent set for intervals by divide and conquer with pruning.
Networks, 2007
MolProbity: allatom contacts and structure validation for proteins and nucleic acids.
Nucleic Acids Research, 2007
Faster placement of hydrogens in protein structures by dynamic programming.
ACM Journal of Experimental Algorithmics, 2007
Maintaining solvent accessible surface area under rotamer substitution for protein design.
Journal of Computational Chemistry, 2007
AlmostDelaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL.
Comput. Geom., 2007
Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007
Mining RNA Tertiary Motifs with Structure Graphs.
Proceedings of the 19th International Conference on Scientific and Statistical Database Management, 2007
Quadratic and cubic bsplines by generalizing higherorder voronoi diagrams.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007
Terrain Representation using RightTriangulated Irregular Networks.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
Capturing Crossings: Convex Hulls of Segment and Plane Intersections.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
Artifacts Caused by Simplicial Subdivision.
IEEE Trans. Vis. Comput. Graph., 2006
Streaming computation of Delaunay triangulations.
ACM Trans. Graph., 2006
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm.
SIAM J. Comput., 2006
Guest Editors' Foreword.
Discrete & Computational Geometry, 2006
Editorial.
Comput. Geom., 2006
Spherebased Computation of Delaunay Diagrams on Points from 4d Grids.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006
Earlysplit coding of triangle mesh connectivity.
Proceedings of the Graphics Interface 2006 Conference, June 79, 2006, Quebec, Canada, 2006
Generating Raster DEM from Mass Points Via TIN Streaming.
Proceedings of the Geographic Information Science, 4th International Conference, 2006
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
Illustrating the streaming construction of 2D delaunay triangulations.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation.
Proceedings of the 3rd International Symposium on 3D Data Processing, 2006
2005
Comparing Graph Representations of Protein Structure for Mining FamilySpecific ResidueBased Packing Motifs.
Journal of Computational Biology, 2005
Editorial.
Comput. Geom., 2005
Polygonal path simplification with angle constraints.
Comput. Geom., 2005
Lossless compression of predicted floatingpoint geometry.
ComputerAided Design, 2005
RotamerPair Energy Calculations Using a Trie Data Structure.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
Streaming compression of triangle meshes.
Proceedings of the 32. International Conference on Computer Graphics and Interactive Techniques, 2005
Streaming Compression of Triangle Meshes.
Proceedings of the Third Eurographics Symposium on Geometry Processing, 2005
An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem.
Proceedings of the Biocomputing 2005, 2005
Implementing timevarying contour trees.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005
Computing Rigid Components of Pseudotriangulation Mechanisms in Linear Time.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Maximum Independent Set for Intervals by DividePruneandConquer.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
Point Location.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Computing a (1+epsilon)Approximate Geometric MinimumDiameter Spanning Tree.
Algorithmica, 2004
Probik: Protein Backbone Motion by Inverse Kinematics.
Proceedings of the Algorithmic Foundations of Robotics VI, 2004
Simplifying Flexible Isosurfaces Using Local Geometric Measures.
Proceedings of the 15th IEEE Visualization 2004 Conference, 2004
AlmostDelaunay simplices: nearest neighbor relations for imprecise points.
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Flooding Triangulated Terrain.
Proceedings of the Developments in Spatial Data Handling, 2004
Mining protein family specific residue packing patterns from protein structure graphs.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004
Banana spiders: A study of connectivity in 3d combinatorial rigidity.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
Faster Placement of Hydrogens in Protein Structures by Dynamic Programming.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004
Encoding Volumetric Grids For Streaming Isosurface Extraction.
Proceedings of the 2nd International Symposium on 3D Data Processing, 2004
2003
The Size of Spanning Disks for Polygonal Curves.
Discrete & Computational Geometry, 2003
The Safari interface for visualizing timedependent volume data using isosurfaces and contour spectra.
Comput. Geom., 2003
Tight degree bounds for pseudotriangulations of points.
Comput. Geom., 2003
Interlocked open and closed linkages with few joints.
Comput. Geom., 2003
Ununfoldable polyhedra with convex faces.
Comput. Geom., 2003
Binary compression rates for ASCII formats.
Proceedings of the Proceeding of the Eighth International Conference on 3D Web Technology, 2003
Large Mesh Simplification using Processing Sequences.
Proceedings of the 14th IEEE Visualization 2003 Conference, 2003
Path Seeds and Flexible Isosurfaces  Using Topology for Exploratory Visualization.
Proceedings of the VisSym 2003, 2003
Compressing Texture Coordinates with Selective Linear Predictions.
Proceedings of the 2003 Computer Graphics International (CGI 2003), 2003
Approximating the geometric minimumdiameter spanning tree.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Algorithmic issues in modeling motion.
ACM Comput. Surv., 2002
Some ApertureAngle Optimization Problems.
Algorithmica, 2002
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
Algorithmica, 2002
Coding polygon meshes as compressable ASCII.
Proceedings of the Seventh International Conference on 3D Web Technology, 2002
Interlocked open linkages with few joints.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002
Testing Homotopy for paths in the plane.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002
Coding with ASCII: compact, yet textbased 3D content.
Proceedings of the 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT 2002), 2002
2001
On exclusion regions for optimal triangulations.
Discrete Applied Mathematics, 2001
A OneStep Crust and Skeleton Extraction Algorithm.
Algorithmica, 2001
Simplicial Subdivisions and Sampling Artifacts.
Proceedings of the IEEE Visualization 2001, 2001
Polygonal path approximation with angle constraints.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Compressing the Property Mapping of Polygon Meshes.
Proceedings of the 9th Pacific Conference on Computer Graphics and Applications (PG 2001), 2001
A Lower Bound for Multicast Key Distribution.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001
A prototype system for visualizing timedependent volume data.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
The arithmetic precision of raypolygon intersection testing.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Counting triangulations and pseudotriangulations of wheels.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Heaphull?.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
The reflexfree hull.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
2000
Compact Voronoi Diagrams for Moving Convex Polygons.
Proceedings of the Algorithm Theory, 2000
Computing contour trees in all dimensions.
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
Face fixer: compressing polygon meshes with properties.
Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, 2000
Intersecting Red and Blue Line Segments in Optimal Time and Precision.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000
Kinetic collision detection for simple polygons.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000
The face fixer video.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000
Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
1999
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time.
Comput. Geom., 1999
Queries with Segments in Voronoi Diagrams.
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Mesh Collapse Compression.
Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI '99), 1999
Efficient Algorithms for Maximum Regression Depth.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Mesh Collapse Compression.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Generalizing Ham Sandwich Cuts to Equitable Subdivisions.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Spanning Trees Crossing Few Barriers.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
Practical PointinPolygon Tests Using CSG Representations of Polygons.
Proceedings of the Algorithm Engineering and Experimentation, 1999
1998
Fitting a Set of Points by a Circle.
Discrete & Computational Geometry, 1998
Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time.
Comput. Geom., 1998
Erased arrangements of lines and convex decompositions of polyhedra.
Comput. Geom., 1998
CrossRatios and Angles Determine a Polygon.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
Implementations of the LMT Heuristic for Minimum Weight Triangulation.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
On the time bound for convex decomposition of simple polygons.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Removing degeneracies by perturbing the problem or perturbing the world.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1997
Primal Dividing and Dual Pruning: OutputSensitive Construction of FourDimensional Polytopes and ThreeDimensional Voronoi Diagrams.
Discrete & Computational Geometry, 1997
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997
Using CSG representations of polygons for practical pointinpolygon tests.
Proceedings of the ACM SIGGRAPH 97 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '97, 1997
LinearTime Reconstruction of Delaunay Triangulations with Applications.
Proceedings of the Algorithms, 1997
Good Orders for Incremental (Re)construction.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
Easy triangle strips for tin terrain models.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997
1996
Efficiently Planning Compliant Motion in the Plane.
SIAM J. Comput., 1996
A Compact PiecewiseLinear Voronoi Diagram for Convex Sites in the Plane.
Discrete & Computational Geometry, 1996
Generating Random Polygons with Given Vertices.
Comput. Geom., 1996
Point Location in Zones of Kflats in Arrangements.
Comput. Geom., 1996
On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
On Computing Edges That Are In All MinimumWeight Triangulations.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
On the Sectional Area of Convex Polytopes.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Approximating Shortest Paths in Arrangements of Lines.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
The Complexity of Rivers in Triangulated Terrains.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1995
Two and ThreeDimensional Point Location in Rectangular Subdivisions.
J. Algorithms, 1995
Tentative PruneandSearch for Computing FixedPoints with Applications to Geometric Computation.
Fundam. Inform., 1995
Computing Common Tangents Without a Separating Line.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
OutputSensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three.
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms, 1995
Finding the Medial Axis of a Simple Polygon in Linear Time.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Optimal Algorithms to Embed Trees in a Point Set.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995
Geometry in GIS is not Combinatorial: Segment Intersection for Polygon Overlay.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
The complexity of a single face of a minkowski sum.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995
Computing the largest inscribed isothetic rectangle.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995
1994
Minimumlink Coriented paths: Singlesource queries.
Int. J. Comput. Geometry Appl., 1994
Computing Minimum Length Paths of a Given Homotopy Class.
Comput. Geom., 1994
An O(n log n) Implementation of the DouglasPeucker Algorithm for Line Simplification.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994
Generating Random xMonotone Polygons with Given Vertices.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
An Efficient Solution to the Zookeeper's Problem.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1993
Computing a Face in an Arrangement of Line Segments and Related Problems.
SIAM J. Comput., 1993
Counting and Reporting Red/Blue Segment Intersections.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
A Compact PiecewiseLinear Voronoi Diagram for Convex Sites in the Plane
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
Objects That Cannot be Taken Apart with Two Hands.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993
Video: Objects that Cannot be Taken Apart with Two Hands.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993
Tentative PruneandSearch for Computing Voronoi Vertices.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993
Maintaining the Approximate Width of a Set of Points in the Plane.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
Twodimensional Computation of the Threedimensional Reachable Region for a Welding Head.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
Folding Rulers inside Triangles.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra.
Proceedings of the Algorithm Theory, 1992
Two and ThreeDimensional Point Location in Rectangular Subdivisions (Extended Abstract).
Proceedings of the Algorithm Theory, 1992
Recognizing an Envelope of Lines in Linear Time.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
An Optimal Algorithm for the OnLine ClosestPair Problem.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992
1991
Counting and Cutting Cycles of Lines and Rods in Space.
Comput. Geom., 1991
Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1991
Computing a Face in an Arrangement of Line Segments.
Proceedings of the Second Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1991
Approximating Polygons and Subdivisions with Minimum Link Paths.
Proceedings of the ISA '91 Algorithms, 1991
Ray Shooting in Polygons Using Geodesic Triangulations.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
Efficient Ray Shooting and Hidden Surface Removal.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991
1990
Stabbing Parallel Segments with a Convex Polygon.
Computer Vision, Graphics, and Image Processing, 1990
InputSensitive Compliant Motion in the Plane.
Proceedings of the SWAT 90, 1990
Compact Interval Trees: A Data Structure for Convex Hulls.
Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, 1990
Counting and Cutting Cycles of Lines and Rods in Space
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Sweeping Arrangements of Curves.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990
A Trivial Knot Whose Spanning Disks Have Exponential Size.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
1989
On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discrete & Computational Geometry, 1989
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989
Sweeping Arrangements of Curves.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989
Compliant Motion in a Simple Polygon.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989
1988
An efficient algorithm for finding the CSG representation of a simple polygon.
Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques, 1988
Implicitly Representing Arrangements of Lines or Segments.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
On Arrangements of Jordan Arcs with Three Intersections per Pair.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988