Boris Aronov

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
60Connect the dot: Computing feed-links for network extension. Boris Aronov, Kevin Buchin, Maike Buchin, Bart Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann. J. Spatial Information Science (3): 3-31 (2011). Web SearchBibTeXDownload
59Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi. Symposium on Computational Geometry 2011, 407-416. Web SearchBibTeXDownload
2010
58Computing similarity between piecewise-linear functions. Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. Symposium on Computational Geometry 2010, 375-383. Web SearchBibTeXDownload
2009
57Connect the Dot: Computing Feed-Links with Minimum Dilation. Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann. WADS 2009, 49-60. Web SearchBibTeXDownload
2008
56Sparse geometric graphs with small dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. Comput. Geom. (40): 207-219 (2008). Web SearchBibTeXDownload
55Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Boris Aronov, Mark de Berg, Chris Gray. Comput. Geom. (41): 68-76 (2008). Web SearchBibTeXDownload
54The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. Boris Aronov, Mark de Berg, Shripad Thite. ESA 2008, 100-111. Web SearchBibTeXDownload
53Cutting cycles of rods in space: hardness and approximation. Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford. SODA 2008, 1241-1248. Web SearchBibTeXDownload
2007
52Sparse geometric graphs with small dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron. CoRR (abs/cs/0702080) (2007). Web SearchBibTeXDownload
2006
51Efficient algorithms for bichromatic separability. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. ACM Transactions on Algorithms (2): 209-227 (2006). Web SearchBibTeXDownload
50Cost prediction for ray shooting in octrees. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. Comput. Geom. (34): 159-181 (2006). Web SearchBibTeXDownload
49On the Union of kappa-Round Objects in Three and Four Dimensions. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (36): 511-526 (2006). Web SearchBibTeXDownload
48Fréchet Distance for Curves, Revisited. Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk. ESA 2006, 52-63. Cited by 12Web SearchBibTeXDownload
47Polyline Fitting of Planar Points under Min-sum Criteria. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (16): 97-116 (2006). Web SearchBibTeXDownload
46Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. LATIN 2006, 80-92. Web SearchBibTeXDownload
45Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Boris Aronov, Mark de Berg, Chris Gray. Symposium on Computational Geometry 2006, 88-94. Web SearchBibTeXDownload
2005
44Cost-driven octree construction schemes: an experimental study. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. Comput. Geom. (31): 127-148 (2005). Web SearchBibTeXDownload
43Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. CoRR (abs/cs/0512091) (2005). Web SearchBibTeXDownload
42Incidences between Points and Circles in Three and Higher Dimensions. Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (33): 185-206 (2005). Web SearchBibTeXDownload
41Lines Avoiding Unit Balls in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (34): 231-250 (2005). Web SearchBibTeXDownload
40Cutting Triangular Cycles of Lines in Space. Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (33): 231-247 (2005). Web SearchBibTeXDownload
39Sparse Geometric Graphs with Small Dilation. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron. ISAAC 2005, 50-59. Web SearchBibTeXDownload
2004
38Distinct Distances in Three and Higher Dimensions. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos. Combinatorics, Probability & Computing (13): 283-293 (2004). Web SearchBibTeXDownload
37Polyline Fitting of Planar Points Under Min-sum Criteria. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama. ISAAC 2004, 77-88. Web SearchBibTeXDownload
36Efficient algorithms for bichromatic separability. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. SODA 2004, 682-690. Web SearchBibTeXDownload
35On the union of kapa-round objects. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 383-390. Web SearchBibTeXDownload
34On lines avoiding unit balls in three dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 36-45. Web SearchBibTeXDownload
2003
33Cutting triangular cycles of lines in space. Boris Aronov, Vladlen Koltun, Micha Sharir. STOC 2003, 547-555. Web SearchBibTeXDownload
32Distinct distances in three and higher dimensions. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos. STOC 2003, 541-546. Web SearchBibTeXDownload
31Cost-driven octree construction schemes: an experimental study. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. Symposium on Computational Geometry 2003, 227-236. Web SearchBibTeXDownload
2002
30Visibility Queries and Maintenance in Simple Polygons. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang. Discrete & Computational Geometry (27): 461-483 (2002). Web SearchBibTeXDownload
29Incidences between points and circles in three and higher dimensions. Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 116-122. Web SearchBibTeXDownload
28Cost prediction for ray shooting. Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang. Symposium on Computational Geometry 2002, 293-302. Web SearchBibTeXDownload
2001
27Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (26): 307-320 (2001). Web SearchBibTeXDownload
26On the Complexity of Many Faces in Arrangements of Circles. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. FOCS 2001, 74-83. Web SearchBibTeXDownload
2000
25Approximation Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Discrete & Computational Geometry (24): 687-705 (2000). Web SearchBibTeXDownload
24On the Number of Views of Polyhedral Scenes. Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer. JCDCG 2000, 81-90. Cited by 7Web SearchBibTeXDownload
23Exact and approximation algorithms for minimum-width cylindrical shells. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SODA 2000, 510-517. Web SearchBibTeXDownload
1999
22Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (21): 373-388 (1999). Web SearchBibTeXDownload
21Motion Planning for Multiple Robots. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels. Discrete & Computational Geometry (22): 505-525 (1999). Web SearchBibTeXDownload
20Motion Planning for a Convex Polygon in a Polygonal Environment. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (22): 201-221 (1999). Web SearchBibTeXDownload
19Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Symposium on Computational Geometry 1999, 380-389. Web SearchBibTeXDownload
1998
18On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir. Discrete & Computational Geometry (19): 315-331 (1998). Web SearchBibTeXDownload
17Visibility Queries in Simple Polygons and Applications. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang. ISAAC 1998, 357-366. Web SearchBibTeXDownload
16Motion Planning for Multiple Robots. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels. Symposium on Computational Geometry 1998, 374-382. Web SearchBibTeXDownload
1997
15Quasi-Planar Graphs Have a Linear Number of Edges. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir. Combinatorica (17): 1-9 (1997). Web SearchBibTeXDownload
14Computing Envelopes in Four Dimensions with Applications. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SIAM J. Comput. (26): 1714-1732 (1997). Web SearchBibTeXDownload
13Star Unfolding of a Polytope with Applications. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon. SIAM J. Comput. (26): 1689-1713 (1997). Web SearchBibTeXDownload
12Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SODA 1997, 483-492. Web SearchBibTeXDownload
11On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Symposium on Computational Geometry 1997, 30-38. Web SearchBibTeXDownload
1995
10Quasi-Planar Graphs Have a Linear Number of Edges. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir. Graph Drawing 1995, 1-7. Web SearchBibTeXDownload
9Stabbing Triangulations by Lines in 3D. Pankaj K. Agarwal, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1995, 267-276. Web SearchBibTeXDownload
1994
8Can Visibility Graphs Be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Discrete & Computational Geometry (12): 347-365 (1994). Web SearchBibTeXDownload
7Computing Envelopes in Four Dimensions with Applications. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Symposium on Computational Geometry 1994, 348-358. Web SearchBibTeXDownload
1993
6Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Algorithmica (9): 495-514 (1993). Web SearchBibTeXDownload
5Can Visibility Graphs be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1993, 338-347. Web SearchBibTeXDownload
1992
4Counting Facets and Incidences. Pankaj K. Agarwal, Boris Aronov. Discrete & Computational Geometry (7): 359-369 (1992). Web SearchBibTeXDownload
1991
3Computing external farthest neighbors for a simple polygon. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Discrete Applied Mathematics (31): 97-111 (1991). Web SearchBibTeXDownload
1990
2Star Unfolding of a Polytope with Applications (Extended Abstract). Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon. SWAT 1990, 251-263. Web SearchBibTeXDownload
1Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Symposium on Computational Geometry 1990, 321-331. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research