Vintage Publications

This is a list of my publications before the year 2000.
Click here for my most recent papers .

T. Fevens, H. Meijer, and D. Rappaport.
Minimum convex k-partitions of a linearly constrained point set.
In 4th Center for Geometric Computing Workshop on Computational Geometry, 1999.

Kelly A. Lyons, Henk Meijer, and David Rappaport.
Algorithms for cluster busting in anchored graph drawing.
J. Graph Algorithms Appl., 2(1):1-24, 1998.
PS

Esther M. Arkin, H. Meijer, Joseph S. B. Mitchell, D. Rappaport, and S. S. Skiena.
Decision trees for geometric models.
Internat. J. Comput. Geom. Appl., 8:343-364, 1998.
also in In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 369-378, 1993.
PS

Thomas Fevens, Henk Meijer, and David Rappaport.
Minimum weight convex quadrilateralization of a constrained point set.
In 2nd Center for Geometric Computing Workshop on Computational Geometry, 1997.
PS

D. Rappaport.
Minimum polygon transversals of line segments.
Internat. J. Comput. Geom. Appl., 5:243-256, 1995.
PS PDF

Paul Colley, Henk Meijer, and David Rappaport.
Motivating lazy guards.
In Proc. 7th Canad. Conf. Comput. Geom., pages 121-126, 1995.
PS

D. Rappaport and A. Rosenbloom.
Moldable and castable polygons.
Comput. Geom. Theory Appl., 4:219-233, 1994.
also in In Proc. 4th Canad. Conf. Comput. Geom., pages 322-327, 1992.
PS

K. A. Lyons and D. Rappaport.
An efficient algorithm for identifying objects using robot probes.
Visual Comput., 10:452-458, 1994.
also in In Abstracts 1st Canad. Conf. Comput. Geom., page 7, 1989.
PS

P. Colley, H. Meijer, and D. Rappaport.
Optimal nearly-similar polygon stabbers of convex polygons.
In Proc. 6th Canad. Conf. Comput. Geom., pages 269-274, 1994.
PS

K. A. Lyons, H. Meijer, and D. Rappaport.
Properties of the Voronoi diagram cluster buster.
In A. Gawman, W. M. Getleman, E. Kidd, P. Larson, and J. Slonim, editors, Proc. 1993 CAS Conference, volume 2, pages 1148-1163, Toronto, Ontario, Canada, 1993.


H. El-Gindy, M. Houle, W. Lenhart, M. Miller, D. Rappaport, and S. Whitesides.
Dominance drawings of bipartite graphs.
In Proc. 5th Canad. Conf. Comput. Geom., pages 187-191, 1993.
PS

P. Eades and D. Rappaport.
The complexity of computing minimum separating polygons.
Pattern Recogn. Lett., 14:715-718, 1993.
PDF

Yasukazu Aoki, Hiroshi Imai, Keiko Imai, and David Rappaport.
Probing a set of hyperplanes by lines and related problems.
In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes Comput. Sci., pages 72-82. Springer-Verlag, 1993.
PS

David Rappaport.
A convex hull algorithm for discs, and applications.
Comput. Geom. Theory Appl., 1(3):171-181, 1992.


H. Meijer and D. Rappaport.
Computing the minimum weight triangulation of a set of linearly ordered points.
In Proc. 3rd Canad. Conf. Comput. Geom., pages 175-178, 1991.


J. Czyzowicz, P. Egyed, H. Everett, D. Rappaport, T. Shermer, D. Souvaine, G. Toussaint, and J. Urrutia.
The aquarium keeper’s problem.
In Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, pages 459-464, 1991.
PDF

Rappaport, H. Imai, and G. T. Toussaint.
Computing simple circuits from a set of line segments.
Discrete Comput. Geom., 5(3):289-304, 1990.
also in Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 52-60, 1986.
PDF

H. Meijer and D. Rappaport.
Upper and lower bounds for the number of monotone crossing free Hamiltonian cycles from a set of points.
Ars Combin., 30:203-208, 1990.


H. Meijer and D. Rappaport.
Minimum polygon covers of parallel line segments.
In Proc. 2nd Canad. Conf. Comput. Geom., pages 324-327, 1990.


D. Rappaport.
Computing the furthest-site Voronoi diagram for a set of discs.
In Proc. 1st Workshop Algorithms Data Struct., volume 382 of Lecture Notes Comput. Sci., pages 57-66. Springer-Verlag, 1989.


R. Hayward, D. Rappaport, and R. Wenger.
Some extremal results on circles containing points.
Discrete Comput. Geom., 4:253-258, 1989.


D. Rappaport.
Computing simple circuits from a set of line segments is NP-complete.
SIAM J. Comput., 18(6):1128-1139, 1989.
also in Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 322-330, 1987.
PDF

D. Avis and D. Rappaport.
Computing monotone simple circuits in the plane.
In G. T. Toussaint, editor, Computational Morphology, pages 13-23. North-Holland, Amsterdam, Netherlands, 1988.


D. Rappaport.
On the complexity of computing orthogonal polygons from a set of points.
Technical Report TR-SOCS-86.9, McGill Univ., Montreal, PQ, 1986.


D. Rappaport.
A linear algorithm for eliminating hidden lines from a polygonal cylinder.
Visual Comput., 2:44-53, 1986.


D. Rappaport.
The Complexity of Computing Simple Circuits in the Plane.
Ph.D. thesis, School Comput. Sci., McGill Univ., Montreal, PQ, 1986.


D. Rappaport and G. T. Toussaint.
A simple linear hidden-line algorithm for star-shaped polygons.
Pattern Recogn. Lett., 3:35-39, 1985.


D. Avis and D. Rappaport.
Computing the largest empty convex subset of a set of points.
In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 161-167, 1985.
PDF

Click here for my most recent papers .