The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Boris Aronov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs be Represented Compactly? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:338-347 [Conf]
  3. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:380-389 [Conf]
  4. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    On lines avoiding unit balls in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:36-45 [Conf]
  5. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:348-358 [Conf]
  6. Pankaj K. Agarwal, Boris Aronov, Subhash Suri
    Stabbing Triangulations by Lines in 3D. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:267-276 [Conf]
  7. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    On Levels in Arrangements of Lines, Segments, Planes, and Triangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:30-38 [Conf]
  8. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:321-331 [Conf]
  9. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
    Results on k-Sets and j-Facets via Continuous Motion. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:192-199 [Conf]
  10. Boris Aronov
    On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:39-49 [Conf]
  11. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost prediction for ray shooting. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:293-302 [Conf]
  12. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost-driven octree construction schemes: an experimental study. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:227-236 [Conf]
  13. Boris Aronov, Mark de Berg, Chris Gray
    Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:88-94 [Conf]
  14. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:374-382 [Conf]
  15. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:112-115 [Conf]
  16. Boris Aronov, Paz Carmi, Matthew J. Katz
    Minimum-cost load-balancing partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:301-308 [Conf]
  17. Boris Aronov, Tamal K. Dey
    Polytopes in Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:154-162 [Conf]
  18. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with Reflection. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:316-325 [Conf]
  19. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:351-356 [Conf]
  20. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
    On the union of kapa-round objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:383-390 [Conf]
  21. Boris Aronov, Steven Fortune
    Average-Case Ray Shooting and Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:203-211 [Conf]
  22. Boris Aronov, Steven Fortune, Gordon T. Wilfong
    The Furthest-Site Geodesic Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:229-240 [Conf]
  23. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    A Helly-type theorem for hyperplane transversals to well-separated convex sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:57-63 [Conf]
  24. Boris Aronov, Vladlen Koltun, Micha Sharir
    Incidences between points and circles in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:116-122 [Conf]
  25. Boris Aronov, Jirí Matousek, Micha Sharir
    On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:307-313 [Conf]
  26. Boris Aronov, Joseph O'Rourke
    Nonoverlap of the Star Unfolding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:105-114 [Conf]
  27. Boris Aronov, Micha Sharir
    Triangles in Space or Building (and Analyzing) Castles in the Air. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:381-391 [Conf]
  28. Boris Aronov, Micha Sharir
    Castles in the Air Revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:146-156 [Conf]
  29. Boris Aronov, Micha Sharir
    On Translational Motion Planning in 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:21-30 [Conf]
  30. Franz Aurenhammer, Friedrich Hoffman, Boris Aronov
    Minkowski-Type Theorems and Least-Squares Partitioning. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:350-357 [Conf]
  31. Boris Aronov, Sariel Har-Peled, Micha Sharir
    On approximate halfspace range counting and relative epsilon-approximations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:327-336 [Conf]
  32. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
    Fréchet Distance for Curves, Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:52-63 [Conf]
  33. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    On the Complexity of Many Faces in Arrangements of Circles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:74-83 [Conf]
  34. Boris Aronov, Micha Sharir
    The Union of Convex Polyhedra in Three Dimensions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:518-527 [Conf]
  35. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:1-7 [Conf]
  36. Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan
    Facility Location on Terrains. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:19-28 [Conf]
  37. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points Under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:77-88 [Conf]
  38. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
    A Generalization of Magic Squares with Applications to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:89-100 [Conf]
  39. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
    Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:50-59 [Conf]
  40. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang
    Visibility Queries in Simple Polygons and Applications. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:357-366 [Conf]
  41. 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]
  42. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  43. Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu
    The Complexity of Diffuse Reflections in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:93-104 [Conf]
  44. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
    Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:682-690 [Conf]
  45. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Exact and approximation algorithms for minimum-width cylindrical shells. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:510-517 [Conf]
  46. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:483-492 [Conf]
  47. Boris Aronov, Sariel Har-Peled
    On approximating the depth and related problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:886-894 [Conf]
  48. Boris Aronov, Shakhar Smorodinsky
    On geometric permutations induced by lines transversal through a fixed point. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:251-256 [Conf]
  49. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting triangular cycles of lines in space. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:547-555 [Conf]
  50. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct distances in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:541-546 [Conf]
  51. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Star Unfolding of a Polytope with Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:251-263 [Conf]
  52. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:284-295 [Conf]
  53. 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]
  54. Boris Aronov, Micha Sharir
    On the Zone of a Surface in a Hyperplane Arrangement. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:13-19 [Conf]
  55. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:5, pp:495-514 [Journal]
  56. Boris Aronov
    On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:1, pp:109-140 [Journal]
  57. Franz Aurenhammer, F. Hoffmann, Boris Aronov
    Minkowski-Type Theorems and Least-Squares Clustering. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:1, pp:61-76 [Journal]
  58. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:1-9 [Journal]
  59. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:127-134 [Journal]
  60. Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The number of edges of many faces in a line segment arrangement. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:261-274 [Journal]
  61. Boris Aronov, Micha Sharir
    Triangles in space or building (and analyzing) castles in the air. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:137-173 [Journal]
  62. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost-driven octree construction schemes: an experimental study. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:127-148 [Journal]
  63. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
    Cost prediction for ray shooting in octrees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:3, pp:159-181 [Journal]
  64. Boris Aronov, Jacob E. Goodman, Richard Pollack
    A Helly-type theorem for higher-dimensional transversals. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:177-183 [Journal]
  65. Boris Aronov, Micha Sharir
    The Common Exterior of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:139-149 [Journal]
  66. Boris Aronov, Robert Schiffenbauer, Micha Sharir
    On the number of views of translates of a cube and related problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:2, pp:179-192 [Journal]
  67. Boris Aronov, Raimund Seidel, Diane L. Souvaine
    On Compatible Triangulations of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:27-35 [Journal]
  68. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct Distances in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:283-293 [Journal]
  69. Boris Aronov, Marshall W. Bern, David Eppstein
    On the Number of Minimal 1-Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:29-34 [Journal]
  70. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
    Motion Planning for Multiple Robots. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:505-525 [Journal]
  71. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:435-442 [Journal]
  72. Boris Aronov, Tamal K. Dey
    Polytopes in Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:1, pp:51-63 [Journal]
  73. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with Multiple Reflections. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:1, pp:61-78 [Journal]
  74. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
    Visibility with One Reflection. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:4, pp:553-574 [Journal]
  75. 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]
  76. Boris Aronov, Steven Fortune
    Approximating Minimum-Weight Triangulations in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:4, pp:527-549 [Journal]
  77. Boris Aronov, Steven Fortune, Gordon T. Wilfong
    The Furthest-Site Geodesic Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:217-255 [Journal]
  78. Pankaj K. Agarwal, Boris Aronov
    Counting Facets and Incidences. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:359-369 [Journal]
  79. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    On the Helly Number for Hyperplane Transversals to Unit Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:171-176 [Journal]
  80. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs Be Represented Compactly?. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:347-365 [Journal]
  81. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:507-517 [Journal]
  82. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir
    On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:315-331 [Journal]
  83. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang
    Visibility Queries and Maintenance in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:4, pp:461-483 [Journal]
  84. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:687-705 [Journal]
  85. Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan
    Facility Location on a Polyhedral Surface. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:3, pp:357-372 [Journal]
  86. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    Lines Avoiding Unit Balls in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:2, pp:231-250 [Journal]
  87. Boris Aronov, Vladlen Koltun, Micha Sharir
    Incidences between Points and Circles in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:185-206 [Journal]
  88. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:307-320 [Journal]
  89. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting Triangular Cycles of Lines in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:231-247 [Journal]
  90. Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir
    An Invariant Property of Balls in Arrangements of Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:421-425 [Journal]
  91. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Motion Planning for a Convex Polygon in a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:2, pp:201-221 [Journal]
  92. Boris Aronov, Joseph O'Rourke
    Nonoverlap of the Star Unfolding. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:219-250 [Journal]
  93. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:3, pp:373-388 [Journal]
  94. Boris Aronov, Marco Pellegrini, Micha Sharir
    On the Zone of a Surface in a Hyperplane Arrangement. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:177-186 [Journal]
  95. Boris Aronov, Micha Sharir
    Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:475-490 [Journal]
  96. Boris Aronov, Micha Sharir
    Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:1, pp:107-115 [Journal]
  97. Boris Aronov, Shakhar Smorodinsky
    Geometric Permutations Induced by Line Transversals through a Fixed Point. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:2, pp:285-294 [Journal]
  98. Boris Aronov, Micha Sharir
    Castles in the Air Revisited. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:119-150 [Journal]
  99. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
    On the Union of kappa-Round Objects in Three and Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:511-526 [Journal]
  100. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:97-116 [Journal]
  101. Boris Aronov
    A lower bound on Voronoi diagram complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:4, pp:183-185 [Journal]
  102. Boris Aronov, Jirí Matousek, Micha Sharir
    On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:65, n:2, pp:311-321 [Journal]
  103. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Star Unfolding of a Polytope with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1689-1713 [Journal]
  104. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1714-1732 [Journal]
  105. Boris Aronov, Micha Sharir
    On Translational Motion Planning of a Convex Polyhedron in 3-Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1785-1803 [Journal]
  106. Boris Aronov, Micha Sharir, Boaz Tagansky
    The Union of Convex Polyhedra in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1670-1688 [Journal]
  107. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
    Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:209-227 [Journal]
  108. Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira
    Largest Subsets of Triangles in a Triangulation. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:213-216 [Conf]
  109. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
    Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  110. Computing similarity between piecewise-linear functions. [Citation Graph (, )][DBLP]


  111. The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. [Citation Graph (, )][DBLP]


  112. Feed-links for network extensions. [Citation Graph (, )][DBLP]


  113. Optimal Triangulation with Steiner Points. [Citation Graph (, )][DBLP]


  114. Cutting cycles of rods in space: hardness and approximation. [Citation Graph (, )][DBLP]


  115. Small-size epsilon-nets for axis-parallel rectangles and boxes. [Citation Graph (, )][DBLP]


  116. Connect the Dot: Computing Feed-Links with Minimum Dilation. [Citation Graph (, )][DBLP]


  117. Minimum-Cost Load-Balancing Partitions. [Citation Graph (, )][DBLP]


  118. Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]


  119. Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. [Citation Graph (, )][DBLP]


  120. Small weak epsilon-nets. [Citation Graph (, )][DBLP]


  121. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  122. Witness Gabriel Graphs [Citation Graph (, )][DBLP]


  123. Witness (Delaunay) Graphs [Citation Graph (, )][DBLP]


  124. Computing external farthest neighbors for a simple polygon. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.012secs
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