The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dan Halperin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dan Halperin
    Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:3- [Conf]
  2. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
    On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:127-132 [Conf]
  3. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
    Arrangements of Segments that Share Endpoints: Single Face Results. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:324-333 [Conf]
  4. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an Object from its Cast. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:221-230 [Conf]
  5. Mark de Berg, Leonidas J. Guibas, Dan Halperin
    Vertical Decompositions for Triangles in 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:1-10 [Conf]
  6. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:21-30 [Conf]
  7. Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin
    The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:457-459 [Conf]
  8. Eran Eyal, Dan Halperin
    Dynamic maintenance of molecular surfaces under conformational changes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:45-54 [Conf]
  9. Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz
    Exact minkowski sums and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:273-274 [Conf]
  10. Efi Fogel, Dan Halperin
    Exact Minkowski sums of convex polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:382-383 [Conf]
  11. Dan Halperin
    On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:314-323 [Conf]
  12. Dan Halperin, Eran Leiserowitz
    Controlled perturbation for arrangements of circles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:264-273 [Conf]
  13. Dan Halperin, Jean-Claude Latombe, Randall H. Wilson
    A General Framework for Assembly Planning: The Motion Space Approach. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:9-18 [Conf]
  14. Dan Halperin, Mark H. Overmars
    Efficient Motion Planning for an L-Shaped Object. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:156-166 [Conf]
  15. Dan Halperin, Mark H. Overmars
    Spheres, Molecules, and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:113-122 [Conf]
  16. Dan Halperin, Micha Sharir
    New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:11-18 [Conf]
  17. Dan Halperin, Micha Sharir
    Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:11-20 [Conf]
  18. Dan Halperin, Christian R. Shelton
    A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:183-192 [Conf]
  19. Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
    The 2-center problem with obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:80-90 [Conf]
  20. Dan Halperin, Chee-Keng Yap
    Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:29-37 [Conf]
  21. Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe
    Efficient maintenance and self-collision testing for Kinematic Chains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:43-52 [Conf]
  22. Hayim Shaul, Dan Halperin
    Improved construction of vertical decompositions of three-dimensional arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:283-292 [Conf]
  23. Efi Fogel, Dan Halperin, Christophe Weibel
    On the exact maximum complexity of Minkowski sums of convex polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:319-326 [Conf]
  24. Ron Wein, Jur P. van den Berg, Dan Halperin
    The Visibility-Voronoi Complex and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:63-72 [Conf]
  25. Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin
    Continuous path verification in multi-axis NC-machining. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:86-95 [Conf]
  26. Pankaj K. Agarwal, Eyal Flato, Dan Halperin
    Polygon Decomposition for Efficient Construction of Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:20-31 [Conf]
  27. Eti Ezra, Dan Halperin, Micha Sharir
    Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:473-484 [Conf]
  28. Efi Fogel, Ron Wein, Dan Halperin
    Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:664-676 [Conf]
  29. Eyal Flato, Dan Halperin
    Robust and Efficient Construction of Planar Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:85-88 [Conf]
  30. Dan Halperin, Micha Sharir
    Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:382-391 [Conf]
  31. Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson
    A Simple and Effeicient Procedure for Polyhedral Assembly Partitioning under Infinitesimal Motions. [Citation Graph (0, 0)][DBLP]
    ICRA, 1995, pp:2553-2560 [Conf]
  32. Dan Halperin, Randall H. Wilson
    Assembly Partitioning along Simple Paths: the Case of Multiple Translations. [Citation Graph (0, 0)][DBLP]
    ICRA, 1995, pp:1585-1592 [Conf]
  33. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
    Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles. [Citation Graph (0, 0)][DBLP]
    ICRA (1), 1993, pp:297-304 [Conf]
  34. Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:1-10 [Conf]
  35. Angela Enosh, Sarel J. Fleishman, Nir Ben-Tal, Dan Halperin
    Assigning transmembrane segments to helices in intermediate-resolution structures. [Citation Graph (0, 0)][DBLP]
    ISMB/ECCB (Supplement of Bioinformatics), 2004, pp:122-129 [Conf]
  36. Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer
    On the Number of Views of Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:81-90 [Conf]
  37. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
    Efficient Generation of k-Directional Assembly Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:122-131 [Conf]
  38. Moses Charikar, Dan Halperin, Rajeev Motwani
    The Dynamic Servers Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:410-419 [Conf]
  39. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
    On the Number of Regular Vertices of the Union of Jordan Regions. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:322-334 [Conf]
  40. Eran Eyal, Dan Halperin
    Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:401-413 [Conf]
  41. Paul W. Finn, Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian
    Geometric Manipulation of Flexible Ligands. [Citation Graph (0, 0)][DBLP]
    WACG, 1996, pp:67-78 [Conf]
  42. Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
    On-Line Zone Construction in Arrangements of Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:139-153 [Conf]
  43. Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan
    The Design and Implementation of Planar Maps in CGAL. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:154-168 [Conf]
  44. Iddo Hanniel, Dan Halperin
    Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:171-182 [Conf]
  45. Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
    Efficient Ray Shooting and Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:30-53 [Journal]
  46. Dan Halperin, Jean-Claude Latombe, Randall H. Wilson
    A General Framework for Assembly Planning: The Motion Space Approach. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:3-4, pp:577-601 [Journal]
  47. Angela Enosh, Sarel J. Fleishman, Nir Ben-Tal, Dan Halperin
    Prediction and simulation of motion in pairs of transmembrane alpha-helices. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:2, pp:212-218 [Journal]
  48. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an object from its cast. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2002, v:34, n:8, pp:547-559 [Journal]
  49. Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein, Myung-Soo Kim
    Precise global collision detection in multi-axis NC-machining. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2005, v:37, n:9, pp:909-920 [Journal]
  50. Daniel Cohen-Or, Gadi Fibich, Dan Halperin, Eyal Zadicario
    Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 1998, v:17, n:3, pp:243-254 [Journal]
  51. Pankaj K. Agarwal, Eyal Flato, Dan Halperin
    Polygon decomposition for efficient construction of Minkowski sums. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:39-61 [Journal]
  52. Eti Ezra, Dan Halperin, Micha Sharir
    Speeding up the incremental construction of the union of geometric objects in practice. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:63-85 [Journal]
  53. Dan Halperin, Mark H. Overmars
    Spheres, molecules, and hidden surface removal. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:2, pp:83-102 [Journal]
  54. Dan Halperin, Eli Packer
    Iterated snap rounding. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:209-225 [Journal]
  55. Dan Halperin, Micha Sharir
    Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:269-303 [Journal]
  56. Dan Halperin, Christian R. Shelton
    A perturbation scheme for spherical arrangements with application to molecular modeling. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:4, pp:273-287 [Journal]
  57. Dan Halperin, Chee-Keng Yap
    Combinatorial complexity of translating a box in polyhedral 3-space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:3, pp:181-196 [Journal]
  58. A. Frank van der Stappen, Dan Halperin, Mark H. Overmars
    The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:353-373 [Journal]
  59. Mark de Berg, Dan Halperin, Mark H. Overmars
    An intersection-sensitive algorithm for snap rounding. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:159-165 [Journal]
  60. Ron Wein, Jur P. van den Berg, Dan Halperin
    The visibility-Voronoi complex and its applications. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:66-87 [Journal]
  61. Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph S. B. Mitchell, Nir Naor
    Arrangements of Segments that Share Endpoints Single Face Results. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:257-270 [Journal]
  62. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
    On the Number of Regular Vertices of the Union of Jordan Regions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:203-220 [Journal]
  63. Pankaj K. Agarwal, Dan Halperin, Richard Pollack
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:505-506 [Journal]
  64. Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin
    On the Area Bisectors of a Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:2, pp:269-285 [Journal]
  65. Mark de Berg, Leonidas J. Guibas, Dan Halperin
    Vertical Decompositions for Triangles in 3-Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:35-61 [Journal]
  66. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
    Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:2, pp:113-122 [Journal]
  67. Dan Halperin
    On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:1-33 [Journal]
  68. Dan Halperin, Micha Sharir
    New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:313-326 [Journal]
  69. Dan Halperin, Micha Sharir
    Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:385-410 [Journal]
  70. Dan Halperin, Micha Sharir
    A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:2, pp:121-134 [Journal]
  71. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld
    Sparse Arrangements and the Number of Views of Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:3, pp:175-195 [Journal]
  72. Dan Halperin, Eran Leiserowitz
    Controlled perturbation for arrangements of circles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:4-5, pp:277-310 [Journal]
  73. Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson
    Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:2, pp:179-200 [Journal]
  74. Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled
    An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:6, pp:463-485 [Journal]
  75. Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin
    Continuous Path Verification in Multi-axis Nc-machining. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:351-378 [Journal]
  76. Dan Halperin
    Robust Geometric Computing in Motion. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2002, v:21, n:3, pp:219-232 [Journal]
  77. Dan Halperin, Micha Sharir
    On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:4, pp:189-192 [Journal]
  78. Dan Halperin, Micha Sharir
    On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:53-56 [Journal]
  79. Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
    The 2-Center Problem with Obstacles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:109-134 [Journal]
  80. Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe
    Algorithm and Data Structures for Efficient Energy Maintenance during Monte Carlo Simulation of Proteins. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:5, pp:902-932 [Journal]
  81. Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra
    The Design and Implementation of Planar Maps in CGAL. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:13- [Journal]
  82. Dan Halperin, Mark H. Overmars, Micha Sharir
    Efficient Motion Planning for an L-Shaped Object. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:1-23 [Journal]
  83. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:2, pp:301-317 [Journal]
  84. Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehlhorn, Ron Wein
    Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:645-656 [Conf]
  85. Ron Wein, Efi Fogel, Baruch Zukerman, Dan Halperin
    Advanced programming techniques applied to Cgal's arrangement package. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:1-2, pp:37-63 [Journal]

  86. The complexity of the outer face in arrangements of random segments. [Citation Graph (, )][DBLP]


  87. Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space. [Citation Graph (, )][DBLP]


  88. Arrangements of geodesic arcs on the sphere. [Citation Graph (, )][DBLP]


  89. Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location. [Citation Graph (, )][DBLP]


  90. The visibility-Voronoi complex and its applications. [Citation Graph (, )][DBLP]


  91. Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic. [Citation Graph (, )][DBLP]


  92. Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. [Citation Graph (, )][DBLP]


  93. Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. [Citation Graph (, )][DBLP]


  94. Planning Near-Optimal Corridors Amidst Obstacles. [Citation Graph (, )][DBLP]


  95. Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact. [Citation Graph (, )][DBLP]


  96. Assembly partitioning along simple paths: the case of multiple translations. [Citation Graph (, )][DBLP]


  97. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. [Citation Graph (, )][DBLP]


  98. A Little More, a Lot Better: Improving Path Quality by a Simple Path Merging Algorithm [Citation Graph (, )][DBLP]


  99. On the Exact Maximum Complexity of Minkowski Sums of Polytopes. [Citation Graph (, )][DBLP]


  100. Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002