2012
23Sparsification of Motion-Planning Roadmaps by Edge Contraction. Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin. CoRR (abs/1209.4463) (2012). Web SearchBibTeXDownload
2008
22The complexity of the outer face in arrangements of random segments. Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir. Symposium on Computational Geometry 2008, 69-78. Web SearchBibTeXDownload
2007
21An intersection-sensitive algorithm for snap rounding. Mark de Berg, Dan Halperin, Mark H. Overmars. Comput. Geom. (36): 159-165 (2007). Web SearchBibTeXDownload
2002
20Separating an object from its cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, JirÝ Matousek, Otfried Schwarzkopf. Computer-Aided Design (34): 547-559 (2002). Web SearchBibTeXDownload
19Polygon decomposition for efficient construction of Minkowski sums. Pankaj K. Agarwal, Eyal Flato, Dan Halperin. Comput. Geom. (21): 39-61 (2002). Web SearchBibTeXDownload
2001
18Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Discrete & Computational Geometry (25): 505-506 (2001). Web SearchBibTeXDownload
17On the Number of Regular Vertices of the Union of Jordan Regions. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir. Discrete & Computational Geometry (25): 203-220 (2001). Web SearchBibTeXDownload
2000
16Polygon Decomposition for Efficient Construction of Minkowski Sums. Pankaj K. Agarwal, Eyal Flato, Dan Halperin. ESA 2000, 20-31. Web SearchBibTeXDownload
15On the Number of Views of Polyhedral Scenes. Boris Aronov, HervÚ Br÷nnimann, Dan Halperin, Robert Schiffenbauer. JCDCG 2000, 81-90. Cited by 7Web SearchBibTeXDownload
1998
14Combinatorial complexity of translating a box in polyhedral 3-space. Dan Halperin, Chee-Keng Yap. Comput. Geom. (9): 181-196 (1998). Web SearchBibTeXDownload
13The Dynamic Servers Problem. Moses Charikar, Dan Halperin, Rajeev Motwani. SODA 1998, 410-419. Cited by 6Web SearchBibTeXDownload
12On the Number of Regular Vertices of the Union of Jordan Regions. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir. SWAT 1998, 322-334. Web SearchBibTeXDownload
1997
11Sparse Arrangements and the Number of Views of Polyhedral Scenes. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld. Int. J. Comput. Geometry Appl. (7): 175-195 (1997). Web SearchBibTeXDownload
10Separating an Object from its Cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, JirÝ Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1997, 221-230. Web SearchBibTeXDownload
1996
9Vertical Decompositions for Triangles in 3-Space. Mark de Berg, Leonidas J. Guibas, Dan Halperin. Discrete & Computational Geometry (15): 35-61 (1996). Web SearchBibTeXDownload
8Efficient Generation of k-Directional Assembly Sequences. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir. SODA 1996, 122-131. Web SearchBibTeXDownload
7Geometric Manipulation of Flexible Ligands. Paul W. Finn, Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian. WACG 1996, 67-78. Cited by 38Web SearchBibTeXDownload
1995
6Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. Theor. Comput. Sci. (140): 301-317 (1995). Web SearchBibTeXDownload
1994
5Efficient Ray Shooting and Hidden Surface Removal. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld. Algorithmica (12): 30-53 (1994). Web SearchBibTeXDownload
4Vertical Decompositions for Triangles in 3-Space. Mark de Berg, Leonidas J. Guibas, Dan Halperin. Symposium on Computational Geometry 1994, 1-10. Web SearchBibTeXDownload
1993
3Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. ISAAC 1993, 1-10. Web SearchBibTeXDownload
2Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. Dan Halperin, Chee-Keng Yap. Symposium on Computational Geometry 1993, 29-37. Web SearchBibTeXDownload
1991
1Efficient Ray Shooting and Hidden Surface Removal. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld. Symposium on Computational Geometry 1991, 21-30. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research