Technical Reports
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
31 matches found for Dobkin, David P.:
- Dobkin, David P.
- Geometric Complexity and Computer Graphics - Does Theory Apply in Practice?, TR-014-85, July 1985
- Intersection of Convex Objects in Two and Three Dimensions, TR-025-86, January 1986
- Decomposition and Intersection of Simple Splinegons, TR-051-86, August 1986
- Robust Contour Tracing, TR-054-86, September 1986
- Computational Geometry - Then and Now, TR-084-87, March 1987
- Primitives for the Manipulation of Three-Dimensional Subdivisions, TR-089-87, April 1987
- Delaunay Graphs are Almost as Good as Complete Graphs, TR-113-87, June 1987
- Recipes for Geometry & Numerical Analysis - Part I: An Empirical Study, TR-144-88, March 1988
- An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon, TR-152-88, May 1988
- Searching for Empty Convex Polygons, TR-153-88, May 1988
- A Library for Incremental Update of Bitmap Images, TR-174-88, September 1988
- Applied Computational Geometry: Towards Robust Solutions of Basic Problems, TR-192-88, December 1988
- Maintenance of Geometric Extrema, TR-196-88, December 1988
- Detecting the Intersection of Convex Objects in the Plane, TR-231-89, October 1989
- Visibility with a Moving Point of View, TR-235-89, November 1989
- Determining the Separation of Preprocessed Polyhedra - A Unified Approach, TR-255-90, April 1990
- Generating Sparse Spanners for Weighted Graphs, TR-261-90, April 1990
- Optimal Algorithms for Computing Connected Components of Bichromatic Line Segments and Polygons, TR-366-92, March 1992
- The New Jersey Line-Segment-Saw Massacre (Companion to Video), TR-379-92, July 1992
- Computational Geometry and Computer Graphics, TR-383-92, August 1992
- Building and Using Polyhedral Hierarchies, TR-411-93, February 1993
- Computing the Rectangle Discrepancy, TR-443-94, January 24, 1994
- Computing the Maximum Bichromatic Discrepancy, with Applications to Computer Graphics and Machine Learning, TR-467-94, October 1994
- The Maximum Discrepancy of Simple Geometric Ranges, TR-480-94, December 1994
- Concept Learning with Simple Geometric Hypotheses, TR-481-94, December 1994
- Visualization of Geometric Algorithms, TR-559-95, February 1995
- Computing the Discrepancy with Applicaitons to Supersampling Patterns, TR-561-96, September 1996
- Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning, TR-562-95, December 1995
- Concept Learning with Geometric Hypotheses, TR-563-95, December 1995
- Strategies for Polyhedral Surface Decomposition: An Experimental Study, TR-564-95, December 1995
- The Quickhull Algorithm for Convex Hulls, TR-565-95, January 1995
