Search the dblp DataBase
David Rappaport :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Kelly A. Lyons , Henk Meijer , David Rappaport Properties of the voronoi diagram cluster buster. [Citation Graph (0, 0)][DBLP ] CASCON, 1993, pp:1148-1163 [Conf ] Greg Aloupis , Thomas Fevens , Stefan Langerman , Tomomi Matsui , Antonio Mesa , David Rappaport , Godfried T. Toussaint Computing the Similarity of two Melodies. [Citation Graph (0, 0)][DBLP ] CCCG, 2003, pp:81-84 [Conf ] Boris Aronov , Franz Aurenhammer , Ferran Hurtado , Stefan Langerman , David Rappaport , Shakhar Smorodinsky , Carlos Seara Small weak epsilon nets. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:52-56 [Conf ] Prosenjit Bose , Ferran Hurtado , Henk Meijer , Suneeta Ramaswami , David Rappaport , Vera Sacristan , Thomas C. Shermer , Godfried T. Toussaint Finding specified sections of arrangements: 2d results. [Citation Graph (0, 0)][DBLP ] CCCG, 1998, pp:- [Conf ] Erik D. Demaine , Francisco Gomez-Martin , Henk Meijer , David Rappaport , Perouz Taslakian , Godfried T. Toussaint , Terry Winograd , David R. Wood The Distance Geometry of Deep Rhythms and Scales. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:163-166 [Conf ] Kathryn Duffy , Chris McAloney , Henk Meijer , David Rappaport Closest Segments. [Citation Graph (0, 0)][DBLP ] CCCG, 2005, pp:232-234 [Conf ] Paul Colley , Henk Meijer , David Rappaport Optimal Nearly-Similar Polygon Stabbers of Convex Polygons. [Citation Graph (0, 0)][DBLP ] CCCG, 1994, pp:269-274 [Conf ] Hossam A. ElGindy , Michael E. Houle , William Lenhart , Mirka Miller , David Rappaport , Sue Whitesides Dominance Drawings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] CCCG, 1993, pp:187-191 [Conf ] Ferran Hurtado , Mikio Kano , David Rappaport , Csaba D. Tóth Encompassing colored crossing-free geometric graphs. [Citation Graph (0, 0)][DBLP ] CCCG, 2004, pp:48-52 [Conf ] Henk Meijer , David Rappaport Simultaneous edge flips for convex subdivisions. [Citation Graph (0, 0)][DBLP ] CCCG, 2004, pp:57-59 [Conf ] Esther M. Arkin , Henk Meijer , Joseph S. B. Mitchell , David Rappaport , Steven Skiena Decision Trees for Geometric Models. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:369-378 [Conf ] David Rappaport Computing Simple Circuits from a Set of Line Segments is NP-Complete. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1987, pp:322-330 [Conf ] David Rappaport , Hiroshi Imai , Godfried T. Toussaint On Computing Simple Circuits on a Set of Line Segments. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1986, pp:52-60 [Conf ] Michael Hirsch , Henk Meijer , David Rappaport Biclique Edge Cover Graphs and Confluent Drawings. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2006, pp:405-416 [Conf ] José Miguel Díaz-Báñez , Ferran Hurtado , Henk Meijer , David Rappaport , Joan Antoni Sellarès The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (3), 2002, pp:46-54 [Conf ] Kiyoshi Hosono , David Rappaport , Masatsugu Urabe On Convex Decompositions of Points. [Citation Graph (0, 0)][DBLP ] JCDCG, 2000, pp:149-155 [Conf ] David Rappaport Tight Bounds for Visibility Matching of f-Equal Width Objects. [Citation Graph (0, 0)][DBLP ] JCDCG, 2002, pp:246-250 [Conf ] Jirel Czyzowicz , Peter Egyed , Hazel Everett , David Rappaport , Thomas C. Shermer , Diane L. Souvaine , Godfried T. Toussaint , Jorge Urrutia The Aquarium Keeper's Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1991, pp:459-464 [Conf ] Yasukazu Aoki , Hiroshi Imai , Keiko Imai , David Rappaport Probing a Set of Hyperplanes by Lines and Related Problems. [Citation Graph (0, 0)][DBLP ] WADS, 1993, pp:72-82 [Conf ] David Rappaport Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). [Citation Graph (0, 0)][DBLP ] WADS, 1989, pp:57-66 [Conf ] Manuel Abellanas , Sergey Bereg , Ferran Hurtado , Alfredo García Olaverri , David Rappaport , Javier Tejel Moving coins. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2006, v:34, n:1, pp:35-48 [Journal ] David Rappaport The visibility graph of congruent discs is Hamiltonian. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2003, v:25, n:3, pp:257-265 [Journal ] David Rappaport A Convex Hull Algorithm for Discs, and Applications. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1991, v:1, n:, pp:171-187 [Journal ] David Rappaport , Arnold Rosenbloom Moldable and Castable Polygons. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1994, v:4, n:, pp:219-233 [Journal ] Thomas Fevens , Henk Meijer , David Rappaport Minimum convex partition of a constrained point set. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:95-107 [Journal ] Kiyoshi Hosono , Henk Meijer , David Rappaport On the visibility graph of convex translates. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:195-210 [Journal ] David Rappaport , Hiroshi Imai , Godfried T. Toussaint Computing Simple Circuits form a Set of Line Segments. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1990, v:5, n:, pp:289-304 [Journal ] Esther M. Arkin , Henk Meijer , Joseph S. B. Mitchell , David Rappaport , Steven Skiena Decision trees for geometric models. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:343-364 [Journal ] José Miguel Díaz-Báñez , Ferran Hurtado , Henk Meijer , David Rappaport , Joan Antoni Sellarès The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:317-325 [Journal ] David Rappaport Minimum polygon transversals of line segments. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1995, v:5, n:3, pp:243-256 [Journal ] Henk Meijer , David Rappaport Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:545-546 [Journal ] Henk Meijer , David Rappaport Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:35-38 [Journal ] Izidor Gertner , David Rappaport Stochastic control of system with unobserved jump parameter process. [Citation Graph (0, 0)][DBLP ] Inf. Sci., 1977, v:13, n:3, pp:269-282 [Journal ] Izidor Gertner , David Rappaport Optimality criteria for controlled discontinous processes. [Citation Graph (0, 0)][DBLP ] Inf. Sci., 1979, v:17, n:1, pp:75-90 [Journal ] Kelly A. Lyons , Henk Meijer , David Rappaport Algorithms for Cluster Busting in Anchored Graph Drawing. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 1998, v:2, n:1, pp:- [Journal ] Prosenjit Bose , Ferran Hurtado , Henk Meijer , Suneeta Ramaswami , David Rappaport , Vera Sacristan , Thomas C. Shermer , Godfried T. Toussaint Finding Specified Sections of Arrangements: 2D Results. [Citation Graph (0, 0)][DBLP ] J. Math. Model. Algorithms, 2002, v:1, n:1, pp:3-16 [Journal ] Peter Eades , David Rappaport The complexity of computing minimum separating polygons. [Citation Graph (0, 0)][DBLP ] Pattern Recognition Letters, 1993, v:14, n:9, pp:715-718 [Journal ] David Rappaport Computing Simple Circuits from a Set of Line Segments is NP-Complete. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:6, pp:1128-1139 [Journal ] Kelly A. Lyons , David Rappaport An efficient algorithm for identifying objects using robot probes. [Citation Graph (0, 0)][DBLP ] The Visual Computer, 1994, v:10, n:8, pp:452-458 [Journal ] David Rappaport A linear algorithm for eliminating hidden-lines from a polygonal cylinder. [Citation Graph (0, 0)][DBLP ] The Visual Computer, 1986, v:2, n:1, pp:44-53 [Journal ] Yurai Núñez Rodríguez , David Rappaport Tight Bounds for Point Recolouring. [Citation Graph (0, 0)][DBLP ] CCCG, 2006, pp:- [Conf ] Kamrul Islam , Henk Meijer , Yurai Núñez Rodríguez , David Rappaport , Henry Xiao Hamilton Circuits in Hexagonal Grid Graphs. [Citation Graph (0, 0)][DBLP ] CCCG, 2007, pp:85-88 [Conf ] Ferran Hurtado , Mikio Kano , David Rappaport , Csaba D. Tóth Encompassing colored planar straight line graphs. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2008, v:39, n:1, pp:14-23 [Journal ] Erik D. Demaine , Francisco Gomez-Martin , Henk Meijer , David Rappaport , Perouz Taslakian , Godfried T. Toussaint , Terry Winograd , David R. Wood The Distance Geometry of Music [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] On the Complexity of Point Recolouring in Geometric Graphs. [Citation Graph (, )][DBLP ] Computing the largest empty convex subset of a set of points. [Citation Graph (, )][DBLP ] Bi-chromatic minimum spanning trees. [Citation Graph (, )][DBLP ] Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. [Citation Graph (, )][DBLP ] Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. [Citation Graph (, )][DBLP ] Bounds for point recolouring in geometric graphs. [Citation Graph (, )][DBLP ] Editorial CCCG 2006. [Citation Graph (, )][DBLP ] Compatible geometric matchings. [Citation Graph (, )][DBLP ] The distance geometry of music. [Citation Graph (, )][DBLP ] Small weak epsilon-nets. [Citation Graph (, )][DBLP ] Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP ] Search in 0.028secs, Finished in 0.030secs