- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j70 |      | Boris Aronov, Muriel Dulieu: How to cover a point set with a V-shape of minimum width. Comput. Geom. 46(3): 298-309 (2013) |
| c68 | | Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals: Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911 |
| 2012 | ||
| j69 | | Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia: Minimizing the error of linear separators on linearly inseparable data. Discrete Applied Mathematics 160(10-11): 1441-1452 (2012) |
| j68 | | Boris Aronov, Mark de Berg: Unions of Fat Convex Polytopes Have Short Skeletons. Discrete & Computational Geometry 48(1): 53-64 (2012) |
| c67 | | Guillaume Moroz, Boris Aronov: Computing the distance between piecewise-linear bivariate functions. SODA 2012: 288-293 |
| 2011 | ||
| j67 | | Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011) |
| j66 | | Boris Aronov, Muriel Dulieu, Ferran Hurtado: Witness (Delaunay) graphs. Comput. Geom. 44(6-7): 329-344 (2011) |
| j65 | | Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote: Lines Pinning Lines. Discrete & Computational Geometry 45(2): 230-260 (2011) |
| j64 | | Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann: Connect the dot: Computing feed-links for network extension. J. Spatial Information Science 3(1): 3-31 (2011) |
| c66 | | Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi: Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. Symposium on Computational Geometry 2011: 407-416 |
| c65 | | Esther Ezra, Boris Aronov, Micha Sharir: Improved Bound for the Union of Fat Triangles. SODA 2011: 1778-1785 |
| c64 | | Boris Aronov, Muriel Dulieu: How to Cover a Point Set with a V-Shape of Minimum Width. WADS 2011: 61-72 |
| c63 | | |
| i8 | | Guillaume Moroz, Boris Aronov: Computing the Distance between Piecewise-Linear Bivariate Functions. CoRR abs/1107.2312 (2011) |
| i7 | | |
| i6 | | Boris Aronov, Muriel Dulieu: How to Cover a Point Set with a V-Shape of Minimum Width. CoRR abs/1108.2063 (2011) |
| i5 | | Boris Aronov, Dmitriy Drusvyatskiy: Complexity of a Single Face in an Arrangement of s-Intersecting Curves. CoRR abs/1108.4336 (2011) |
| 2010 | ||
| j63 | | Boris Aronov, Tetsuo Asano, Stefan Funke: Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geometry Appl. 20(1): 89-104 (2010) |
| j62 | | Boris Aronov, Micha Sharir: Approximate Halfspace Range Counting. SIAM J. Comput. 39(7): 2704-2725 (2010) |
| j61 | | Boris Aronov, Esther Ezra, Micha Sharir: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39(7): 3248-3282 (2010) |
| c62 | | Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Computing similarity between piecewise-linear functions. Symposium on Computational Geometry 2010: 375-383 |
| i4 | | |
| i3 | | |
| 2009 | ||
| j60 | | Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009) |
| j59 | | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky: Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009) |
| c61 | | Boris Aronov, Esther Ezra, Micha Sharir: Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648 |
| c60 | | Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann: Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 |
| 2008 | ||
| j58 | | Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) |
| j57 | | Boris Aronov, Mark de Berg, Chris Gray: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1-2): 68-76 (2008) |
| j56 | | Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008) |
| j55 | | Boris Aronov, Sariel Har-Peled: On Approximating the Depth and Related Problems. SIAM J. Comput. 38(3): 899-921 (2008) |
| c59 | | Boris Aronov, Mark de Berg, Shripad Thite: The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. ESA 2008: 100-111 |
| c58 | | Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, T. de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann: Feed-links for network extensions. GIS 2008: 35 |
| c57 | | Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford: Cutting cycles of rods in space: hardness and approximation. SODA 2008: 1241-1248 |
| 2007 | ||
| c56 |  | Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira: Largest Subsets of Triangles in a Triangulation. CCCG 2007: 213-216 |
| c55 | | Boris Aronov, Sariel Har-Peled, Micha Sharir: On approximate halfspace range counting and relative epsilon-approximations. Symposium on Computational Geometry 2007: 327-336 |
| c54 | | Boris Aronov, Tetsuo Asano, Stefan Funke: Optimal Triangulation with Steiner Points. ISAAC 2007: 681-691 |
| i2 | | Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) |
| 2006 | ||
| j54 | | Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost prediction for ray shooting in octrees. Comput. Geom. 34(3): 159-181 (2006) |
| j53 | | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the Union of kappa-Round Objects in Three and Four Dimensions. Discrete & Computational Geometry 36(4): 511-526 (2006) |
| j52 | | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geometry Appl. 16(2-3): 97-116 (2006) |
| j51 | | Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun: Efficient algorithms for bichromatic separability. ACM Transactions on Algorithms 2(2): 209-227 (2006) |
| c53 | | Boris Aronov, Mark de Berg, Chris Gray: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Symposium on Computational Geometry 2006: 88-94 |
| c52 | | Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-cost load-balancing partitions. Symposium on Computational Geometry 2006: 301-308 |
| c51 | | Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk: Fréchet Distance for Curves, Revisited. ESA 2006: 52-63 |
| c50 | | 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. LATIN 2006: 80-92 |
| c49 | | Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu: The Complexity of Diffuse Reflections in a Simple Polygon. LATIN 2006: 93-104 |
| 2005 | ||
| j50 | | Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost-driven octree construction schemes: an experimental study. Comput. Geom. 31(1-2): 127-148 (2005) |
| j49 | | Boris Aronov, Vladlen Koltun, Micha Sharir: Incidences between Points and Circles in Three and Higher Dimensions. Discrete & Computational Geometry 33(2): 185-206 (2005) |
| j48 | | Boris Aronov, Vladlen Koltun, Micha Sharir: Cutting Triangular Cycles of Lines in Space. Discrete & Computational Geometry 33(2): 231-247 (2005) |
| j47 | | Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir: Lines Avoiding Unit Balls in Three Dimensions. Discrete & Computational Geometry 34(2): 231-250 (2005) |
| j46 | | Boris Aronov, Shakhar Smorodinsky: Geometric Permutations Induced by Line Transversals through a Fixed Point. Discrete & Computational Geometry 34(2): 285-294 (2005) |
| c48 | | Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara: Small weak epsilon nets. CCCG 2005: 52-56 |
| c47 | | Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 |
| c46 | | Boris Aronov, Shakhar Smorodinsky: On geometric permutations induced by lines transversal through a fixed point. SODA 2005: 251-256 |
| c45 | | |
| i1 | | 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. CoRR abs/cs/0512091 (2005) |
| 2004 | ||
| j45 | | Boris Aronov, Robert Schiffenbauer, Micha Sharir: On the number of views of translates of a cube and related problems. Comput. Geom. 27(2): 179-192 (2004) |
| j44 | | Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct Distances in Three and Higher Dimensions. Combinatorics, Probability & Computing 13(3): 283-293 (2004) |
| j43 | | Boris Aronov, Micha Sharir: Cell Complexities in Hyperplane Arrangements. Discrete & Computational Geometry 32(1): 107-115 (2004) |
| c44 | | Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir: On lines avoiding unit balls in three dimensions. Symposium on Computational Geometry 2004: 36-45 |
| c43 | | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the union of kapa-round objects. Symposium on Computational Geometry 2004: 383-390 |
| c42 | | Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama: Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88 |
| c41 | | Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100 |
| c40 | | Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun: Efficient algorithms for bichromatic separability. SODA 2004: 682-690 |
| 2003 | ||
| j42 | | Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan: Facility Location on a Polyhedral Surface. Discrete & Computational Geometry 30(3): 357-372 (2003) |
| c39 | | Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost-driven octree construction schemes: an experimental study. Symposium on Computational Geometry 2003: 227-236 |
| c38 | | Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct distances in three and higher dimensions. STOC 2003: 541-546 |
| c37 | | Boris Aronov, Vladlen Koltun, Micha Sharir: Cutting triangular cycles of lines in space. STOC 2003: 547-555 |
| 2002 | ||
| j41 | | Boris Aronov, Jacob E. Goodman, Richard Pollack: A Helly-type theorem for higher-dimensional transversals. Comput. Geom. 21(3): 177-183 (2002) |
| j40 | | Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang: Visibility Queries and Maintenance in Simple Polygons. Discrete & Computational Geometry 27(4): 461-483 (2002) |
| j39 | | Boris Aronov, Micha Sharir: Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. Discrete & Computational Geometry 28(4): 475-490 (2002) |
| j38 | | Boris Aronov: A lower bound on Voronoi diagram complexity. Inf. Process. Lett. 83(4): 183-185 (2002) |
| c36 | | Boris Aronov, Vladlen Koltun, Micha Sharir: Incidences between points and circles in three and higher dimensions. Symposium on Computational Geometry 2002: 116-122 |
| c35 | | Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang: Cost prediction for ray shooting. Symposium on Computational Geometry 2002: 293-302 |
| 2001 | ||
| j37 | | Boris Aronov, Tamal K. Dey: Polytopes in Arrangements. Discrete & Computational Geometry 25(1): 51-63 (2001) |
| j36 | | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. Discrete & Computational Geometry 25(2): 203-220 (2001) |
| j35 | | Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger: A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discrete & Computational Geometry 25(4): 507-517 (2001) |
| j34 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discrete & Computational Geometry 26(3): 307-320 (2001) |
| c34 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On the Complexity of Many Faces in Arrangements of Circles. FOCS 2001: 74-83 |
| 2000 | ||
| j33 | | Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger: On the Helly Number for Hyperplane Transversals to Unit Balls. Discrete & Computational Geometry 24(2-3): 171-176 (2000) |
| j32 | | Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation Algorithms for Minimum-Width Annuli and Shells. Discrete & Computational Geometry 24(4): 687-705 (2000) |
| c33 | | Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger: A Helly-type theorem for hyperplane transversals to well-separated convex sets. Symposium on Computational Geometry 2000: 57-63 |
| c32 | | Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer: On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90 |
| c31 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000: 510-517 |
| 1999 | ||
| j31 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discrete & Computational Geometry 21(3): 373-388 (1999) |
| j30 | | Boris Aronov, Steven Fortune: Approximating Minimum-Weight Triangulations in Three Dimensions. Discrete & Computational Geometry 21(4): 527-549 (1999) |
| j29 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Motion Planning for a Convex Polygon in a Polygonal Environment. Discrete & Computational Geometry 22(2): 201-221 (1999) |
| j28 | | Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels: Motion Planning for Multiple Robots. Discrete & Computational Geometry 22(4): 505-525 (1999) |
| c30 | | Boris Aronov, Tamal K. Dey: Polytopes in Arrangements. Symposium on Computational Geometry 1999: 154-162 |
| c29 | | Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Symposium on Computational Geometry 1999: 380-389 |
| 1998 | ||
| j27 | | Franz Aurenhammer, F. Hoffmann, Boris Aronov: Minkowski-Type Theorems and Least-Squares Clustering. Algorithmica 20(1): 61-76 (1998) |
| j26 | | Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discrete & Computational Geometry 19(3): 315-331 (1998) |
| j25 | | Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad: Visibility with One Reflection. Discrete & Computational Geometry 19(4): 553-574 (1998) |
| j24 | | Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad: Visibility with Multiple Reflections. Discrete & Computational Geometry 20(1): 61-78 (1998) |
| c28 | | Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl: Results on k-Sets and j-Facets via Continuous Motion. Symposium on Computational Geometry 1998: 192-199 |
| c27 | | Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels: Motion Planning for Multiple Robots. Symposium on Computational Geometry 1998: 374-382 |
| c26 | | Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan: Facility Location on Terrains. ISAAC 1998: 19-28 |
| c25 | | Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang: Visibility Queries in Simple Polygons and Applications. ISAAC 1998: 357-366 |
| c24 | | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334 |
| 1997 | ||
| j23 | | Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir: Quasi-Planar Graphs Have a Linear Number of Edges. Combinatorica 17(1): 1-9 (1997) |
| j22 | | Boris Aronov, Micha Sharir: The Common Exterior of Convex Polygons in the Plane. Comput. Geom. 8: 139-149 (1997) |
| j21 | | Boris Aronov, Micha Sharir, Boaz Tagansky: The Union of Convex Polyhedra in Three Dimensions. SIAM J. Comput. 26(6): 1670-1688 (1997) |
| j20 | | Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon: Star Unfolding of a Polytope with Applications. SIAM J. Comput. 26(6): 1689-1713 (1997) |
| j19 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26(6): 1714-1732 (1997) |
| j18 | | Boris Aronov, Micha Sharir: On Translational Motion Planning of a Convex Polyhedron in 3-Space. SIAM J. Comput. 26(6): 1785-1803 (1997) |
| c23 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Symposium on Computational Geometry 1997: 30-38 |
| c22 | | Boris Aronov, Steven Fortune: Average-Case Ray Shooting and Minimum Weight Triangulations. Symposium on Computational Geometry 1997: 203-211 |
| c21 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997: 483-492 |
| 1996 | ||
| c20 | | Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad: Visibility with Multiple Reflections. SWAT 1996: 284-295 |
| 1995 | ||
| c19 | | Pankaj K. Agarwal, Boris Aronov, Subhash Suri: Stabbing Triangulations by Lines in 3D. Symposium on Computational Geometry 1995: 267-276 |
| c18 | | Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad: Visibility with Reflection. Symposium on Computational Geometry 1995: 316-325 |
| c17 | | Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir: Quasi-Planar Graphs Have a Linear Number of Edges. Graph Drawing 1995: 1-7 |
| 1994 | ||
| j17 | | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Combinatorica 14(2): 127-134 (1994) |
| j16 | | Boris Aronov, Marshall W. Bern, David Eppstein: On the Number of Minimal 1-Steiner Trees. Discrete & Computational Geometry 12: 29-34 (1994) |
| j15 | | Boris Aronov, Micha Sharir: Castles in the Air Revisited. Discrete & Computational Geometry 12: 119-150 (1994) |
| j14 | | Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri: Can Visibility Graphs Be Represented Compactly?. Discrete & Computational Geometry 12: 347-365 (1994) |
| j13 | | Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory, Ser. A 65(2): 311-321 (1994) |
| c16 | | Boris Aronov, Micha Sharir: On Translational Motion Planning in 3-Space. Symposium on Computational Geometry 1994: 21-30 |
| c15 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Computing Envelopes in Four Dimensions with Applications. Symposium on Computational Geometry 1994: 348-358 |
| 1993 | ||
| j12 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri: Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993) |
| j11 | | Boris Aronov, Raimund Seidel, Diane L. Souvaine: On Compatible Triangulations of Simple Polygons. Comput. Geom. 3: 27-35 (1993) |
| j10 | | Boris Aronov, Marco Pellegrini, Micha Sharir: On the Zone of a Surface in a Hyperplane Arrangement. Discrete & Computational Geometry 9: 177-186 (1993) |
| j9 | | Boris Aronov, Steven Fortune, Gordon T. Wilfong: The Furthest-Site Geodesic Voronoi Diagram. Discrete & Computational Geometry 9: 217-255 (1993) |
| j8 | | Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir: An Invariant Property of Balls in Arrangements of Hyperplanes. Discrete & Computational Geometry 10: 421-425 (1993) |
| c14 | | Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri: Can Visibility Graphs be Represented Compactly? Symposium on Computational Geometry 1993: 338-347 |
| c13 | | |
| 1992 | ||
| j7 | | Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The number of edges of many faces in a line segment arrangement. Combinatorica 12(3): 261-274 (1992) |
| j6 | | Pankaj K. Agarwal, Boris Aronov: Counting Facets and Incidences. Discrete & Computational Geometry 7: 359-369 (1992) |
| j5 | | Boris Aronov, Joseph O'Rourke: Nonoverlap of the Star Unfolding. Discrete & Computational Geometry 8: 219-250 (1992) |
| c12 | | Boris Aronov, Micha Sharir: Castles in the Air Revisited. Symposium on Computational Geometry 1992: 146-156 |
| c11 | | Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov: Minkowski-Type Theorems and Least-Squares Partitioning. Symposium on Computational Geometry 1992: 350-357 |
| 1991 | ||
| j4 | | Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri: Computing external farthest neighbors for a simple polygon. Discrete Applied Mathematics 31(2): 97-111 (1991) |
| j3 | | Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner: Points and Triangles in the Plane and Halving Planes in Space. Discrete & Computational Geometry 6: 435-442 (1991) |
| c10 | | Boris Aronov, Joseph O'Rourke: Nonoverlap of the Star Unfolding. Symposium on Computational Geometry 1991: 105-114 |
| c9 | | Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. Symposium on Computational Geometry 1991: 307-313 |
| c8 | | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Symposium on Computational Geometry 1991: 351-356 |
| c7 | | |
| 1990 | ||
| j2 | | Boris Aronov, Micha Sharir: Triangles in space or building (and analyzing) castles in the air. Combinatorica 10(2): 137-173 (1990) |
| c6 | | Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger: Points and Triangles in the Plane and Halving Planes in Space. Symposium on Computational Geometry 1990: 112-115 |
| c5 | | Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri: Selecting Distances in the Plane. Symposium on Computational Geometry 1990: 321-331 |
| c4 | | Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon: Star Unfolding of a Polytope with Applications (Extended Abstract). SWAT 1990: 251-263 |
| 1989 | ||
| j1 | | Boris Aronov: On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. Algorithmica 4(1): 109-140 (1989) |
| 1988 | ||
| c3 | | Boris Aronov, Steven Fortune, Gordon T. Wilfong: The Furthest-Site Geodesic Voronoi Diagram. Symposium on Computational Geometry 1988: 229-240 |
| c2 | | Boris Aronov, Micha Sharir: Triangles in Space or Building (and Analyzing) Castles in the Air. Symposium on Computational Geometry 1988: 381-391 |
| 1987 | ||
| c1 | | Boris Aronov: On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. Symposium on Computational Geometry 1987: 39-49 |
Data released under the ODC-BY 1.0 license — See also our legal information page