default search action
Boris Aronov
Person information
- affiliation: New York University Tandon School of Engineering, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c99]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. SoCG 2024: 8:1-8:15 - [c98]Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². SoCG 2024: 9:1-9:15 - [c97]Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fréchet Distance Oracles. SoCG 2024: 10:1-10:14 - [c96]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223 - [i35]Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner:
Eight-Partitioning Points in 3D, and Efficiently Too. CoRR abs/2403.02627 (2024) - [i34]Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. CoRR abs/2403.04905 (2024) - [i33]Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh:
Discrete Fr\'echet Distance Oracles. CoRR abs/2404.04065 (2024) - 2023
- [j101]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2(1): 9:1-9:20 (2023) - [j100]Boris Aronov
, Mark de Berg
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - [j99]Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon:
Time and space efficient collinearity indexing. Comput. Geom. 110: 101963 (2023) - [i32]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023) - 2022
- [j98]Boris Aronov, Omrit Filtser
Bipartite Diameter and Other Measures Under Translation. Discret. Comput. Geom. 68(3): 647-663 (2022) - [j97]Boris Aronov
Geometric Pattern Matching Reduces to k-SUM. Discret. Comput. Geom. 68(3): 850-859 (2022) - [j96]Boris Aronov
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. 68(4): 997-1048 (2022) - [c95]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG 2022: 4:1-4:14 - [c94]Boris Aronov, Matthew J. Katz:
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. SWAT 2022: 11:1-11:14 - [i31]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR abs/2203.10241 (2022) - [i30]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning axis-parallel lines in 3D. CoRR abs/2204.01772 (2022) - 2021
- [j95]Boris Aronov
On pseudo-disk hypergraphs. Comput. Geom. 92: 101687 (2021) - [j94]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SIAM J. Comput. 50(2): 760-787 (2021) - [j93]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms 17(3): 24:1-24:21 (2021) - [c93]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15 - [c92]Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. SODA 2021: 1740-1756 - [i29]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR abs/2109.07587 (2021) - 2020
- [j92]Boris Aronov
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica 82(5): 1081-1100 (2020) - [j91]Boris Aronov
Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. 64(3): 627-653 (2020) - [j90]Boris Aronov
Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications. SIAM J. Comput. 49(6): 1109-1127 (2020) - [j89]Boris Aronov
Resolving SINR Queries in a Dynamic Setting. SIAM J. Comput. 49(6): 1271-1290 (2020) - [c91]Boris Aronov
On β-Plurality Points in Spatial Voting Games. SoCG 2020: 7:1-7:15 - [c90]Boris Aronov
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG 2020: 8:1-8:14 - [c89]Boris Aronov
Geometric Pattern Matching Reduces to k-SUM. ISAAC 2020: 32:1-32:9 - [c88]Boris Aronov
Dynamic Time Warping-Based Proximity Problems. MFCS 2020: 9:1-9:12 - [i28]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On beta-Plurality Points in Spatial Voting Games. CoRR abs/2003.07513 (2020) - [i27]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR abs/2003.09533 (2020) - [i26]Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. CoRR abs/2003.11890 (2020) - [i25]Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin:
On Two-Handed Planar Assembly Partitioning. CoRR abs/2009.12369 (2020)
2010 – 2019
- 2019
- [j88]Boris Aronov, Vida Dujmovic, Pat Morin
More Turán-Type Theorems for Triangles in Convex Point Sets. Electron. J. Comb. 26(1): 1 (2019) - [j87]Boris Aronov
Guest Editors' Foreword. Discret. Comput. Geom. 61(4): 695-697 (2019) - [c87]Pankaj K. Agarwal, Boris Aronov
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SoCG 2019: 5:1-5:14 - [c86]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. SODA 2019: 2636-2648 - [c85]Boris Aronov
Bipartite Diameter and Other Measures Under Translation. STACS 2019: 8:1-8:14 - [c84]Boris Aronov
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. WADS 2019: 28-42 - [i24]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. CoRR abs/1904.09526 (2019) - [i23]Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan:
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. CoRR abs/1904.11026 (2019) - 2018
- [j86]Boris Aronov
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80(11): 3316-3334 (2018) - [j85]Boris Aronov
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. Discret. Comput. Geom. 59(3): 725-741 (2018) - [j84]Boris Aronov
Batched Point Location in SINR Diagrams via Algebraic Tools. ACM Trans. Algorithms 14(4): 41:1-41:29 (2018) - [c83]Boris Aronov
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON 2018: 567-578 - [c82]Boris Aronov
Resolving SINR Queries in a Dynamic Setting. ICALP 2018: 145:1-145:13 - [c81]Boris Aronov
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World. MobiHoc 2018: 280-289 - [i22]Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi:
On Pseudo-disk Hypergraphs. CoRR abs/1802.08799 (2018) - [i21]Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. CoRR abs/1804.10654 (2018) - [i20]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR abs/1805.02538 (2018) - [i19]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. CoRR abs/1812.10269 (2018) - 2017
- [j83]Boris Aronov
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. Discret. Comput. Geom. 57(1): 104-124 (2017) - [j82]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-space trade-offs for triangulating a simple polygon. J. Comput. Geom. 8(1): 105-124 (2017) - [c80]Boris Aronov, John Iacono, Khadijeh Sheikhan:
Nearest-Neighbor Search Under Uncertainty. CCCG 2017: 89-94 - [c79]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. SODA 2017: 2476-2494 - [e1]Boris Aronov, Matthew J. Katz:
33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia. LIPIcs 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-038-5 [contents] - [i18]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. CoRR abs/1706.10193 (2017) - 2016
- [j81]Boris Aronov
Distance-sensitive planar point location. Comput. Geom. 54: 17-31 (2016) - [j80]Guillaume Moroz, Boris Aronov
Computing the Distance between Piecewise-Linear Bivariate Functions. ACM Trans. Algorithms 12(1): 3:1-3:13 (2016) - [j79]Boris Aronov
Segmentation of Trajectories on Nonmonotone Criteria. ACM Trans. Algorithms 12(2): 26:1-26:28 (2016) - [j78]Pankaj K. Agarwal, Boris Aronov
Nearest-Neighbor Searching Under Uncertainty II. ACM Trans. Algorithms 13(1): 3:1-3:25 (2016) - [c78]Boris Aronov
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. SoCG 2016: 10:1-10:16 - [c77]Boris Aronov
Almost tight bounds for eliminating depth cycles in three dimensions. STOC 2016: 1-8 - [c76]Boris Aronov
Time-Space Trade-offs for Triangulating a Simple Polygon. SWAT 2016: 30:1-30:12 - [i17]Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann:
Distance-Sensitive Planar Point Location. CoRR abs/1602.00767 (2016) - [i16]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled
Nearest-Neighbor Searching Under Uncertainty II. CoRR abs/1606.00112 (2016) - [i15]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. CoRR abs/1607.06136 (2016) - 2015
- [c75]Boris Aronov
Batched Point Location in SINR Diagrams via Algebraic Tools. ICALP (1) 2015: 65-77 - [i14]Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. CoRR abs/1502.01779 (2015) - [i13]Boris Aronov, Sariel Har-Peled
Fréchet Distance for Curves, Revisited. CoRR abs/1504.07685 (2015) - [i12]Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen:
Time-Space Trade-offs for Triangulating a Simple Polygon. CoRR abs/1509.07669 (2015) - [i11]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. CoRR abs/1512.00358 (2015) - 2014
- [j77]Boris Aronov
Witness Rectangle Graphs. Graphs Comb. 30(4): 827-846 (2014) - [j76]Boris Aronov
Mutual witness proximity graphs. Inf. Process. Lett. 114(10): 519-523 (2014) - [j75]Boris Aronov
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43(2): 543-572 (2014) - [c74]Boris Aronov, Mark V. Yagnatinsky:
Quickly Placing a Point to Maximize Angles. CCCG 2014 - [i10]Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. CoRR abs/1412.0962 (2014) - 2013
- [j74]Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir:
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20(2): 53 (2013) - [j73]Boris Aronov
How to cover a point set with a V-shape of minimum width. Comput. Geom. 46(3): 298-309 (2013) - [j72]Boris Aronov
Witness Gabriel graphs. Comput. Geom. 46(7): 894-908 (2013) - [j71]Pankaj K. Agarwal, Boris Aronov
Computing Correlation between Piecewise-Linear Functions. SIAM J. Comput. 42(5): 1867-1887 (2013) - [c73]Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky:
How to Cover Most of a Point Set with a V-Shape of Minimum Width. CCCG 2013 - [c72]Boris Aronov, Mark V. Yagnatinsky:
How To Place a Point to Maximize Angles. CCCG 2013 - [c71]Pankaj K. Agarwal, Boris Aronov
Nearest neighbor searching under uncertainty II. PODS 2013: 115-126 - [c70]Boris Aronov, Anne Driemel
Segmentation of Trajectories for Non-Monotone Criteria. SODA 2013: 1897-1911 - [c69]Boris Aronov
Distance-Sensitive Planar Point Location. WADS 2013: 49-60 - [i9]Boris Aronov, Mark V. Yagnatinsky:
How To Place a Point to Maximize Angles. CoRR abs/1310.6413 (2013) - 2012
- [j70]Boris Aronov
Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. 160(10-11): 1441-1452 (2012) - [j69]Boris Aronov
Unions of Fat Convex Polytopes Have Short Skeletons. Discret. Comput. Geom. 48(1): 53-64 (2012) - [c68]Guillaume Moroz, Boris Aronov:
Computing the distance between piecewise-linear bivariate functions. SODA 2012: 288-293 - 2011
- [j68]Boris Aronov
Peeling Meshed Potatoes. Algorithmica 60(2): 349-367 (2011) - [j67]Boris Aronov
Witness (Delaunay) graphs. Comput. Geom. 44(6-7): 329-344 (2011) - [j66]Boris Aronov
Lines Pinning Lines. Discret. Comput. Geom. 45(2): 230-260 (2011) - [j65]Boris Aronov
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3(1): 3-31 (2011) - [c67]Mohammad Ali Abam, Boris Aronov
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. SCG 2011: 407-416 - [c66]Esther Ezra, Boris Aronov, Micha Sharir:
Improved Bound for the Union of Fat Triangles. SODA 2011: 1778-1785 - [c65]Boris Aronov
How to Cover a Point Set with a V-Shape of Minimum Width. WADS 2011: 61-72 - [c64]Boris Aronov
Witness Rectangle Graphs. WADS 2011: 73-85 - [i8]Guillaume Moroz, Boris Aronov:
Computing the Distance between Piecewise-Linear Bivariate Functions. CoRR abs/1107.2312 (2011) - [i7]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. CoRR abs/1108.2058 (2011) - [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
- [j64]Boris Aronov
Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geom. Appl. 20(1): 89-104 (2010) - [j63]Boris Aronov
Approximate Halfspace Range Counting. SIAM J. Comput. 39(7): 2704-2725 (2010) - [j62]Boris Aronov
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39(7): 3248-3282 (2010) - [c63]Pankaj K. Agarwal, Boris Aronov
Computing similarity between piecewise-linear functions. SCG 2010: 375-383 - [i4]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Gabriel Graphs. CoRR abs/1008.1051 (2010) - [i3]Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness (Delaunay) Graphs. CoRR abs/1008.1053 (2010)
2000 – 2009
- 2009
- [j61]Boris Aronov
Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009) - [j60]Boris Aronov
Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009) - [c62]Boris Aronov
Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648 - [c61]Boris Aronov
Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 - 2008
- [j59]Boris Aronov
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j58]Boris Aronov
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1-2): 68-76 (2008) - [j57]Boris Aronov
A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008) - [j56]Boris Aronov
On Approximating the Depth and Related Problems. SIAM J. Comput. 38(3): 899-921 (2008) - [c60]Boris Aronov, Mark de Berg, Shripad Thite:
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. ESA 2008: 100-111 - [c59]Boris Aronov
Feed-links for network extensions. GIS 2008: 35 - [c58]Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford:
Cutting cycles of rods in space: hardness and approximation. SODA 2008: 1241-1248 - 2007
- [c57]Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Largest Subsets of Triangles in a Triangulation. CCCG 2007: 213-216 - [c56]Boris Aronov
On approximate halfspace range counting and relative epsilon-approximations. SCG 2007: 327-336 - [c55]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
- [j55]Boris Aronov
Cost prediction for ray shooting in octrees. Comput. Geom. 34(3): 159-181 (2006) - [j54]Boris Aronov
On the Union of kappa-Round Objects in Three and Four Dimensions. Discret. Comput. Geom. 36(4): 511-526 (2006) - [j53]Boris Aronov
Polyline Fitting of Planar Points under Min-sum Criteria. Int. J. Comput. Geom. Appl. 16(2-3): 97-116 (2006) - [j52]Pankaj K. Agarwal, Boris Aronov
Efficient algorithms for bichromatic separability. ACM Trans. Algorithms 2(2): 209-227 (2006) - [c54]Boris Aronov, Mark de Berg, Chris Gray:
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. SCG 2006: 88-94 - [c53]Boris Aronov, Paz Carmi, Matthew J. Katz:
Minimum-cost load-balancing partitions. SCG 2006: 301-308 - [c52]Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk:
Fréchet Distance for Curves, Revisited. ESA 2006: 52-63 - [c51]Boris Aronov
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN 2006: 80-92 - [c50]Boris Aronov
The Complexity of Diffuse Reflections in a Simple Polygon. LATIN 2006: 93-104 - 2005
- [j51]Boris Aronov
Cost-driven octree construction schemes: an experimental study. Comput. Geom. 31(1-2): 127-148 (2005) - [j50]Boris Aronov
Incidences between Points and Circles in Three and Higher Dimensions. Discret. Comput. Geom. 33(2): 185-206 (2005) - [j49]Boris Aronov
Cutting Triangular Cycles of Lines in Space. Discret. Comput. Geom. 33(2): 231-247 (2005) - [j48]Pankaj K. Agarwal, Boris Aronov
Lines Avoiding Unit Balls in Three Dimensions. Discret. Comput. Geom. 34(2): 231-250 (2005) - [j47]Boris Aronov
Geometric Permutations Induced by Line Transversals through a Fixed Point. Discret. Comput. Geom. 34(2): 285-294 (2005) - [c49]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky
Small weak epsilon nets. CCCG 2005: 52-56 - [c48]Boris Aronov
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - [c47]Boris Aronov, Shakhar Smorodinsky
On geometric permutations induced by lines transversal through a fixed point. SODA 2005: 251-256 - [c46]Boris Aronov, Sariel Har-Peled
On approximating the depth and related problems. SODA 2005: 886-894 - [i1]Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. CoRR abs/cs/0512091 (2005) - 2004
- [j46]Boris Aronov
On the number of views of translates of a cube and related problems. Comput. Geom. 27(2): 179-192 (2004) - [j45]Boris Aronov
Distinct Distances in Three and Higher Dimensions. Comb. Probab. Comput. 13(3): 283-293 (2004) - [j44]Boris Aronov
Cell Complexities in Hyperplane Arrangements. Discret. Comput. Geom. 32(1): 107-115 (2004) - [c45]Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir:
On lines avoiding unit balls in three dimensions. SCG 2004: 36-45 - [c44]Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir:
On the union of kapa-round objects. SCG 2004: 383-390 - [c43]Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
Polyline Fitting of Planar Points Under Min-sum Criteria. ISAAC 2004: 77-88 - [c42]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 - [c41]Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun:
Efficient algorithms for bichromatic separability. SODA 2004: 682-690 - 2003
- [j43]Boris Aronov
Facility Location on a Polyhedral Surface. Discret. Comput. Geom. 30(3): 357-372 (2003) - [c40]Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost-driven octree construction schemes: an experimental study. SCG 2003: 227-236 - [c39]Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct distances in three and higher dimensions. STOC 2003: 541-546 - [c38]Boris Aronov, Vladlen Koltun, Micha Sharir:
Cutting triangular cycles of lines in space. STOC 2003: 547-555 - 2002
- [j42]Boris Aronov
A Helly-type theorem for higher-dimensional transversals. Comput. Geom. 21(3): 177-183 (2002) - [j41]Boris Aronov
Visibility Queries and Maintenance in Simple Polygons. Discret. Comput. Geom. 27(4): 461-483 (2002) - [j40]Boris Aronov
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. Discret. Comput. Geom. 28(4): 475-490 (2002) - [j39]Boris Aronov
A lower bound on Voronoi diagram complexity. Inf. Process. Lett. 83(4): 183-185 (2002) - [c37]Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between points and circles in three and higher dimensions. SCG 2002: 116-122 - [c36]Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost prediction for ray shooting. SCG 2002: 293-302 - 2001
- [j38]Boris Aronov
Polytopes in Arrangements. Discret. Comput. Geom. 25(1): 51-63 (2001) - [j37]Boris Aronov
On the Number of Regular Vertices of the Union of Jordan Regions. Discret. Comput. Geom. 25(2): 203-220 (2001) - [j36]Boris Aronov
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discret. Comput. Geom. 25(4): 507-517 (2001) - [j35]Pankaj K. Agarwal, Boris Aronov
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discret. Comput. Geom. 26(3): 307-320 (2001) - [c35]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
On the Complexity of Many Faces in Arrangements of Circles. FOCS 2001: 74-83 - 2000
- [j34]Boris Aronov
On the Helly Number for Hyperplane Transversals to Unit Balls. Discret. Comput. Geom. 24(2-3): 171-176 (2000) - [j33]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled
Approximation Algorithms for Minimum-Width Annuli and Shells. Discret. Comput. Geom. 24(4): 687-705 (2000) - [c34]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-type theorem for hyperplane transversals to well-separated convex sets. SCG 2000: 57-63 - [c33]Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer:
On the Number of Views of Polyhedral Scenes. JCDCG 2000: 81-90 - [c32]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000: 510-517
1990 – 1999
- 1999
- [j32]Pankaj K. Agarwal, Boris Aronov
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discret. Comput. Geom. 21(3): 373-388 (1999) - [j31]Boris Aronov
Approximating Minimum-Weight Triangulations in Three Dimensions. Discret. Comput. Geom. 21(4): 527-549 (1999) - [j30]Pankaj K. Agarwal, Boris Aronov
Motion Planning for a Convex Polygon in a Polygonal Environment. Discret. Comput. Geom. 22(2): 201-221 (1999) - [j29]Boris Aronov
Motion Planning for Multiple Robots. Discret. Comput. Geom. 22(4): 505-525 (1999) - [c31]Boris Aronov, Tamal K. Dey:
Polytopes in Arrangements. SCG 1999: 154-162 - [c30]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled
Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. SCG 1999: 380-389 - 1998
- [j28]Franz Aurenhammer, F. Hoffmann, Boris Aronov
Minkowski-Type Theorems and Least-Squares Clustering. Algorithmica 20(1): 61-76 (1998) - [j27]Pankaj K. Agarwal, Boris Aronov
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discret. Comput. Geom. 19(3): 315-331 (1998) - [j26]Boris Aronov
Visibility with One Reflection. Discret. Comput. Geom. 19(4): 553-574 (1998) - [j25]Boris Aronov
Visibility with Multiple Reflections. Discret. Comput. Geom. 20(1): 61-78 (1998) - [c29]Artur Andrzejak, Boris Aronov, Sariel Har-Peled
Results on k-Sets and j-Facets via Continuous Motion. SCG 1998: 192-199 - [c28]Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. SCG 1998: 374-382 - [c27]Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan:
Facility Location on Terrains. ISAAC 1998: 19-28 - [c26]Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang:
Visibility Queries in Simple Polygons and Applications. ISAAC 1998: 357-366 - [c25]Boris Aronov
On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334 - 1997
- [j24]Pankaj K. Agarwal, Boris Aronov
Quasi-Planar Graphs Have a Linear Number of Edges. Comb. 17(1): 1-9 (1997) - [j23]Boris Aronov
The Common Exterior of Convex Polygons in the Plane. Comput. Geom. 8: 139-149 (1997) - [j22]Boris Aronov
The Union of Convex Polyhedra in Three Dimensions. SIAM J. Comput. 26(6): 1670-1688 (1997) - [j21]Pankaj K. Agarwal, Boris Aronov
Star Unfolding of a Polytope with Applications. SIAM J. Comput. 26(6): 1689-1713 (1997) - [j20]Pankaj K. Agarwal, Boris Aronov
Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26(6): 1714-1732 (1997) - [j19]Boris Aronov
On Translational Motion Planning of a Convex Polyhedron in 3-Space. SIAM J. Comput. 26(6): 1785-1803 (1997) - [c24]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
On Levels in Arrangements of Lines, Segments, Planes, and Triangles. SCG 1997: 30-38 - [c23]Boris Aronov, Steven Fortune:
Average-Case Ray Shooting and Minimum Weight Triangulations. SCG 1997: 203-211 - [c22]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997: 483-492 - 1996
- [c21]Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Multiple Reflections. SWAT 1996: 284-295 - 1995
- [c20]Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink:
The complexity of a single face of a minkowski sum. CCCG 1995: 91-96 - [c19]Pankaj K. Agarwal, Boris Aronov
Stabbing Triangulations by Lines in 3D. SCG 1995: 267-276 - [c18]Boris Aronov
Visibility with Reflection. SCG 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. GD 1995: 1-7 - 1994
- [j18]Boris Aronov
Crossing Families. Comb. 14(2): 127-134 (1994) - [j17]Boris Aronov
On the Number of Minimal 1-Steiner Trees. Discret. Comput. Geom. 12: 29-34 (1994) - [j16]Boris Aronov
Castles in the Air Revisited. Discret. Comput. Geom. 12: 119-150 (1994) - [j15]Pankaj K. Agarwal, Noga Alon, Boris Aronov
Can Visibility Graphs Be Represented Compactly?. Discret. Comput. Geom. 12: 347-365 (1994) - [j14]Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory A 65(2): 311-321 (1994) - [c16]Boris Aronov, Micha Sharir:
On Translational Motion Planning in 3-Space. SCG 1994: 21-30 - [c15]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Computing Envelopes in Four Dimensions with Applications. SCG 1994: 348-358 - 1993
- [j13]Pankaj K. Agarwal, Boris Aronov
Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993) - [j12]Boris Aronov
On Compatible Triangulations of Simple Polygons. Comput. Geom. 3: 27-35 (1993) - [j11]Boris Aronov
On the Zone of a Surface in a Hyperplane Arrangement. Discret. Comput. Geom. 9: 177-186 (1993) - [j10]Boris Aronov
The Furthest-Site Geodesic Voronoi Diagram. Discret. Comput. Geom. 9: 217-255 (1993) - [j9]Boris Aronov
An Invariant Property of Balls in Arrangements of Hyperplanes. Discret. Comput. Geom. 10: 421-425 (1993) - [c14]Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri:
Can Visibility Graphs be Represented Compactly? SCG 1993: 338-347 - [c13]Boris Aronov, Micha Sharir:
The Union of Convex Polyhedra in Three Dimensions. FOCS 1993: 518-527 - 1992
- [j8]Boris Aronov
The number of edges of many faces in a line segment arrangement. Comb. 12(3): 261-274 (1992) - [j7]Pankaj K. Agarwal, Boris Aronov
Counting Facets and Incidences. Discret. Comput. Geom. 7: 359-369 (1992) - [j6]Boris Aronov
Nonoverlap of the Star Unfolding. Discret. Comput. Geom. 8: 219-250 (1992) - [c12]Boris Aronov, Micha Sharir:
Castles in the Air Revisited. SCG 1992: 146-156 - [c11]Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov:
Minkowski-Type Theorems and Least-Squares Partitioning. SCG 1992: 350-357 - 1991
- [j5]Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov
Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. 31(2): 97-111 (1991) - [j4]Boris Aronov
Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. 6: 435-442 (1991) - [j3]Boris Aronov
Minimum-Speed Motions. Int. J. Robotics Res. 10(3): 228-239 (1991) - [c10]Boris Aronov
Nonoverlap of the Star Unfolding. SCG 1991: 105-114 - [c9]Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. SCG 1991: 307-313 - [c8]Boris Aronov
Crossing Families. SCG 1991: 351-356 - [c7]Boris Aronov
On the Zone of a Surface in a Hyperplane Arrangement. WADS 1991: 13-19 - 1990
- [j2]Boris Aronov
Triangles in space or building (and analyzing) castles in the air. Comb. 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. SCG 1990: 112-115 - [c5]Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. SCG 1990: 321-331 - [c4]Pankaj K. Agarwal, Boris Aronov
Star Unfolding of a Polytope with Applications (Extended Abstract). SWAT 1990: 251-263
1980 – 1989
- 1989
- [b1]Boris Aronov:
Combinatorial and algorithmic analysis of space decomposition problems. New York University, USA, 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
The Furthest-Site Geodesic Voronoi Diagram. SCG 1988: 229-240 - [c2]Boris Aronov
Triangles in Space or Building (and Analyzing) Castles in the Air. SCG 1988: 381-391 - 1987
- [c1]Boris Aronov
On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. SCG 1987: 39-49
Coauthor Index
[j100] [j99] [j96] [c95] [i31] [c93] [i29] [j91] [c90] [i27] [j85] [c79] [c77] [i15] [i11] [j75] [j74] [c66] [j63] [j62] [c62] [c56] [j54] [j50] [j49] [j48] [j46] [j45] [j44] [c45] [c44] [c39] [c38] [j40] [c37] [j37] [j35] [c35] [j33] [c32] [j32] [j30] [c30] [j27] [c25] [j24] [j23] [j22] [j20] [j19] [c24] [c22] [c17] [j16] [j14] [c16] [c15] [j13] [j11] [j9] [c13] [j8] [c12] [j4] [c9] [c7] [j2] [c6] [c5] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: