Boris Aronov

According to our database, Boris Aronov authored at least 160 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2024

Discrete Fr\'echet Distance Oracles.

Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh

CoRR, 2024

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R².

Boris Aronov, Mark de Berg, Leonidas Theocharous

CoRR, 2024

A General Technique for Searching in Implicit Sets via Function Inversion.

Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Discrete Fréchet Distance Oracles.

Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh

Proceedings of the 40th International Symposium on Computational Geometry, 2024

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ².

Boris Aronov, Mark de Berg, Leonidas Theocharous

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Eight-Partitioning Points in 3D, and Efficiently Too.

Boris Aronov, Abdul Basit, Indu Ramesh, Gianluca Tasinato, Uli Wagner

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Time and space efficient collinearity indexing.

Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon

Comput. Geom., 2023

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model.

Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir

Comput. Geom., 2023

Partitioning Axis-Parallel Lines in 3D.

Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson

Comput. Geom. Topol., 2023

2022

Bipartite Diameter and Other Measures Under Translation.

Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan

Discret. Comput. Geom., 2022

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems.

Boris Aronov, Esther Ezra, Micha Sharir

Discret. Comput. Geom., 2022

Geometric Pattern Matching Reduces to k-SUM.

Boris Aronov, Jean Cardinal

Discret. Comput. Geom., 2022

Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors.

Boris Aronov, Matthew J. Katz

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems.

Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

On β-Plurality Points in Spatial Voting Games.

Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton

ACM Trans. Algorithms, 2021

Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.

Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl

SIAM J. Comput., 2021

On pseudo-disk hypergraphs.

Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi

Comput. Geom., 2021

On Two-Handed Planar Assembly Partitioning with Connectivity Constraints.

Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Constructive Polynomial Partitioning for Algebraic Curves in ℝ³ with Applications.

Boris Aronov, Esther Ezra, Joshua Zahl

SIAM J. Comput., 2020

Resolving SINR Queries in a Dynamic Setting.

Boris Aronov, Gali Bar-On, Matthew J. Katz

SIAM J. Comput., 2020

Eliminating Depth Cycles Among Triangles in Three Dimensions.

Boris Aronov, Edward Y. Miller, Micha Sharir

Discret. Comput. Geom., 2020

On Two-Handed Planar Assembly Partitioning.

Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin

CoRR, 2020

On beta-Plurality Points in Spatial Voting Games.

Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton

CoRR, 2020

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces.

Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger

Algorithmica, 2020

Dynamic Time Warping-Based Proximity Problems.

Boris Aronov, Matthew J. Katz, Elad Sulami

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.

Boris Aronov, Esther Ezra, Micha Sharir

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Guest Editors' Foreword.

Boris Aronov, Matthew J. Katz

Discret. Comput. Geom., 2019

More Turán-Type Theorems for Triangles in Convex Point Sets.

Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira

Electron. J. Comb., 2019

Efficient Nearest-Neighbor Query and Clustering of Planar Curves.

Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.

Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Batched Point Location in SINR Diagrams via Algebraic Tools.

Boris Aronov, Matthew J. Katz

ACM Trans. Algorithms, 2018

Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions.

Boris Aronov, Micha Sharir

Discret. Comput. Geom., 2018

Data 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

Algorithmica, 2018

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World.

Boris Aronov, Alon Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, Valentin Polishchuk, Boyang Wang, Hanyu Quan, Jiaxin Ding

Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces.

Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Time-space trade-offs for triangulating a simple polygon.

Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen

J. Comput. Geom., 2017

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.

Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc

Discret. Comput. Geom., 2017

Nearest-Neighbor Search Under Uncertainty.

Boris Aronov, John Iacono, Khadijeh Sheikhan

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Computing the Distance between Piecewise-Linear Bivariate Functions.

Guillaume Moroz, Boris Aronov

ACM Trans. Algorithms, 2016

Segmentation of Trajectories on Nonmonotone Criteria.

Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals

ACM Trans. Algorithms, 2016

Nearest-Neighbor Searching Under Uncertainty II.

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang

ACM Trans. Algorithms, 2016

Distance-sensitive planar point location.

Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann

Comput. Geom., 2016

2014

Improved Bounds for the Union of Locally Fat Objects in the Plane.

Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir

SIAM J. Comput., 2014

Mutual witness proximity graphs.

Boris Aronov, Muriel Dulieu, Ferran Hurtado

Inf. Process. Lett., 2014

Witness Rectangle Graphs.

Boris Aronov, Muriel Dulieu, Ferran Hurtado

Graphs Comb., 2014

Quickly Placing a Point to Maximize Angles.

Boris Aronov, Mark V. Yagnatinsky

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Computing Correlation between Piecewise-Linear Functions.

Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira

SIAM J. Comput., 2013

Witness Gabriel graphs.

Boris Aronov, Muriel Dulieu, Ferran Hurtado

Comput. Geom., 2013

How to cover a point set with a V-shape of minimum width.

Boris Aronov, Muriel Dulieu

Comput. Geom., 2013

On the Union Complexity of Diametral Disks.

Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir

Electron. J. Comb., 2013

Distance-Sensitive Planar Point Location.

Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Segmentation of Trajectories for Non-Monotone Criteria.

Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

How To Place a Point to Maximize Angles.

Boris Aronov, Mark V. Yagnatinsky

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

How to Cover Most of a Point Set with a V-Shape of Minimum Width.

Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Unions of Fat Convex Polytopes Have Short Skeletons.

Boris Aronov, Mark de Berg

Discret. Comput. Geom., 2012

Minimizing the error of linear separators on linearly inseparable data.

Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia

Discret. Appl. Math., 2012

2011

Connect the dot: Computing feed-links for network extension.

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

J. Spatial Inf. Sci., 2011

Lines Pinning Lines.

Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote

Discret. Comput. Geom., 2011

Complexity of a Single Face in an Arrangement of s-Intersecting Curves

Boris Aronov, Dmitriy Drusvyatskiy

CoRR, 2011

Witness (Delaunay) graphs.

Boris Aronov, Muriel Dulieu, Ferran Hurtado

Comput. Geom., 2011

Peeling Meshed Potatoes.

Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira

Algorithmica, 2011

Improved Bound for the Union of Fat Triangles.

Esther Ezra, Boris Aronov, Micha Sharir

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons.

Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Approximate Halfspace Range Counting.

Boris Aronov, Micha Sharir

SIAM J. Comput., 2010

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes.

Boris Aronov, Esther Ezra, Micha Sharir

SIAM J. Comput., 2010

Optimal Triangulations of Points and Segments with Steiner Points.

Boris Aronov, Tetsuo Asano, Stefan Funke

Int. J. Comput. Geom. Appl., 2010

Computing similarity between piecewise-linear functions.

Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Small weak epsilon-nets.

Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky

Comput. Geom., 2009

Minimum-Cost Load-Balancing Partitions.

Boris Aronov, Paz Carmi, Matthew J. Katz

Algorithmica, 2009

Connect 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

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Small-size epsilon-nets for axis-parallel rectangles and boxes.

Boris Aronov, Esther Ezra, Micha Sharir

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

On Approximating the Depth and Related Problems.

Boris Aronov, Sariel Har-Peled

SIAM J. Comput., 2008

A Generalization of Magic Squares with Applications to Digital Halftoning.

Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno

Theory Comput. Syst., 2008

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.

Boris Aronov, Mark de Berg, Chris Gray

Comput. Geom., 2008

Sparse 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., 2008

Cutting cycles of rods in space: hardness and approximation.

Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Feed-links for network extensions.

Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains.

Boris Aronov, Mark de Berg, Shripad Thite

Proceedings of the Algorithms, 2008

2007

Optimal Triangulation with Steiner Points.

Boris Aronov, Tetsuo Asano, Stefan Funke

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

On approximate halfspace range counting and relative epsilon-approximations.

Boris Aronov, Sariel Har-Peled, Micha Sharir

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Largest Subsets of Triangles in a Triangulation.

Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Efficient algorithms for bichromatic separability.

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun

ACM Trans. Algorithms, 2006

Polyline Fitting of Planar Points under Min-sum Criteria.

Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama

Int. J. Comput. Geom. Appl., 2006

On the Union of kappa-Round Objects in Three and Four Dimensions.

Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir

Discret. Comput. Geom., 2006

Cost prediction for ray shooting in octrees.

Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang

Comput. Geom., 2006

The Complexity of Diffuse Reflections in a Simple Polygon.

Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Fréchet Distance for Curves, Revisited.

Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk

Proceedings of the Algorithms, 2006

2005

Geometric Permutations Induced by Line Transversals through a Fixed Point.

Boris Aronov, Shakhar Smorodinsky

Discret. Comput. Geom., 2005

Cutting Triangular Cycles of Lines in Space.

Boris Aronov, Vladlen Koltun, Micha Sharir

Discret. Comput. Geom., 2005

Incidences between Points and Circles in Three and Higher Dimensions.

Boris Aronov, Vladlen Koltun, Micha Sharir

Discret. Comput. Geom., 2005

Lines Avoiding Unit Balls in Three Dimensions.

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir

Discret. Comput. Geom., 2005

Cost-driven octree construction schemes: an experimental study.

Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang

Comput. Geom., 2005

On geometric permutations induced by lines transversal through a fixed point.

Boris Aronov, Shakhar Smorodinsky

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Sparse Geometric Graphs with Small Dilation.

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Cell Complexities in Hyperplane Arrangements.

Boris Aronov, Micha Sharir

Discret. Comput. Geom., 2004

Distinct Distances in Three and Higher Dimensions.

Boris Aronov, János Pach, Micha Sharir, Gábor Tardos

Comb. Probab. Comput., 2004

On the number of views of translates of a cube and related problems.

Boris Aronov, Robert Schiffenbauer, Micha Sharir

Comput. Geom., 2004

On the union of kapa-round objects.

Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

Facility Location on a Polyhedral Surface.

Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan

Discret. Comput. Geom., 2003

2002

A lower bound on Voronoi diagram complexity.

Boris Aronov

Inf. Process. Lett., 2002

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces.

Boris Aronov, Micha Sharir

Discret. Comput. Geom., 2002

Visibility Queries and Maintenance in Simple Polygons.

Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang

Discret. Comput. Geom., 2002

A Helly-type theorem for higher-dimensional transversals.

Boris Aronov, Jacob E. Goodman, Richard Pollack

Comput. Geom., 2002

Cost prediction for ray shooting.

Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.

Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger

Discret. Comput. Geom., 2001

On the Number of Regular Vertices of the Union of Jordan Regions.

Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir

Discret. Comput. Geom., 2001

Polytopes in Arrangements.

Boris Aronov, Tamal K. Dey

Discret. Comput. Geom., 2001

Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Discret. Comput. Geom., 2001

On the Complexity of Many Faces in Arrangements of Circles.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

On the Helly Number for Hyperplane Transversals to Unit Balls.

Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger

Discret. Comput. Geom., 2000

Approximation Algorithms for Minimum-Width Annuli and Shells.

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir

Discret. Comput. Geom., 2000

On the Number of Views of Polyhedral Scenes.

Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999

Approximating Minimum-Weight Triangulations in Three Dimensions.

Boris Aronov, Steven Fortune

Discret. Comput. Geom., 1999

Motion Planning for Multiple Robots.

Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels

Discret. Comput. Geom., 1999

Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Discret. Comput. Geom., 1999

Motion Planning for a Convex Polygon in a Polygonal Environment.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Discret. Comput. Geom., 1999

Approximation and Exact Algorithms for Minimum-Width Annuli and Shells.

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Visibility with One Reflection.

Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad

Discret. Comput. Geom., 1998

Visibility with Multiple Reflections.

Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad

Discret. Comput. Geom., 1998

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%.

Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir

Discret. Comput. Geom., 1998

Minkowski-Type Theorems and Least-Squares Clustering.

Franz Aurenhammer, F. Hoffmann, Boris Aronov

Algorithmica, 1998

Facility Location on Terrains.

Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Visibility Queries in Simple Polygons and Applications.

Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.

Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

The Union of Convex Polyhedra in Three Dimensions.

Boris Aronov, Micha Sharir, Boaz Tagansky

SIAM J. Comput., 1997

On Translational Motion Planning of a Convex Polyhedron in 3-Space.

Boris Aronov, Micha Sharir

SIAM J. Comput., 1997

Computing Envelopes in Four Dimensions with Applications.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

SIAM J. Comput., 1997

Star Unfolding of a Polytope with Applications.

Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon

SIAM J. Comput., 1997

The Common Exterior of Convex Polygons in the Plane.

Boris Aronov, Micha Sharir

Comput. Geom., 1997

Quasi-Planar Graphs Have a Linear Number of Edges.

Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir

Comb., 1997

Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Average-Case Ray Shooting and Minimum Weight Triangulations.

Boris Aronov, Steven Fortune

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

On Levels in Arrangements of Lines, Segments, Planes, and Triangles.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1995

Visibility with Reflection.

Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Stabbing Triangulations by Lines in 3D.

Pankaj K. Agarwal, Boris Aronov, Subhash Suri

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

The complexity of a single face of a minkowski sum.

Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, Jack Snoeyink

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

On the Sum of Squares of Cell Complexities in Hyperplane Arrangements.

Boris Aronov, Jirí Matousek, Micha Sharir

J. Comb. Theory A, 1994

Castles in the Air Revisited.

Boris Aronov, Micha Sharir

Discret. Comput. Geom., 1994

On the Number of Minimal 1-Steiner Trees.

Boris Aronov, Marshall W. Bern, David Eppstein

Discret. Comput. Geom., 1994

Can Visibility Graphs Be Represented Compactly?.

Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri

Discret. Comput. Geom., 1994

Crossing Families.

Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman

Comb., 1994

On Translational Motion Planning in 3-Space.

Boris Aronov, Micha Sharir

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

On the Zone of a Surface in a Hyperplane Arrangement.

Boris Aronov, Marco Pellegrini, Micha Sharir

Discret. Comput. Geom., 1993

An Invariant Property of Balls in Arrangements of Hyperplanes.

Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir

Discret. Comput. Geom., 1993

The Furthest-Site Geodesic Voronoi Diagram.

Boris Aronov, Steven Fortune, Gordon T. Wilfong

Discret. Comput. Geom., 1993

On Compatible Triangulations of Simple Polygons.

Boris Aronov, Raimund Seidel, Diane L. Souvaine

Comput. Geom., 1993

Selecting Distances in the Plane.

Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri

Algorithmica, 1993

The Union of Convex Polyhedra in Three Dimensions

Boris Aronov, Micha Sharir

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Nonoverlap of the Star Unfolding.

Boris Aronov, Joseph O'Rourke

Discret. Comput. Geom., 1992

Counting Facets and Incidences.

Pankaj K. Agarwal, Boris Aronov

Discret. Comput. Geom., 1992

The number of edges of many faces in a line segment arrangement.

Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Comb., 1992

Minkowski-Type Theorems and Least-Squares Partitioning.

Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Minimum-Speed Motions.

Boris Aronov, Steven Fortune, Gordon T. Wilfong

Int. J. Robotics Res., 1991

Points and Triangles in the Plane and Halving Planes in Space.

Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger

Discret. Comput. Geom., 1991

Computing external farthest neighbors for a simple polygon.

Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri

Discret. Appl. Math., 1991

On the Zone of a Surface in a Hyperplane Arrangement.

Boris Aronov, Micha Sharir

Proceedings of the Algorithms and Data Structures, 1991

1990

Triangles in space or building (and analyzing) castles in the air.

Boris Aronov, Micha Sharir

Comb., 1990

Star Unfolding of a Polytope with Applications (Extended Abstract).

Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon

Proceedings of the SWAT 90, 1990

1989

Combinatorial and algorithmic analysis of space decomposition problems.

Boris Aronov

PhD thesis, 1989

On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon.

Boris Aronov

Algorithmica, 1989