Boris Aronov

According to our database1, Boris Aronov authored at least 146 papers between 1989 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On pseudo-disk hypergraphs.
Comput. Geom., 2021

On Two-Handed Planar Assembly Partitioning with Connectivity Constraints.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Constructive Polynomial Partitioning for Algebraic Curves in ℝ<sup>3</sup> with Applications.
SIAM J. Comput., 2020

Resolving SINR Queries in a Dynamic Setting.
SIAM J. Comput., 2020

Eliminating Depth Cycles Among Triangles in Three Dimensions.
Discret. Comput. Geom., 2020

On Two-Handed Planar Assembly Partitioning.
CoRR, 2020

On beta-Plurality Points in Spatial Voting Games.
CoRR, 2020

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

Dynamic Time Warping-Based Proximity Problems.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Geometric Pattern Matching Reduces to k-SUM.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

On β-Plurality Points in Spatial Voting Games.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Guest Editors' Foreword.
Discret. Comput. Geom., 2019

More Turán-Type Theorems for Triangles in Convex Point Sets.
Electron. J. Comb., 2019

Efficient Nearest-Neighbor Query and Clustering of Planar Curves.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Bipartite Diameter and Other Measures Under Translation.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Batched Point Location in SINR Diagrams via Algebraic Tools.
ACM Trans. Algorithms, 2018

Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions.
Discret. Comput. Geom., 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Algorithmica, 2018

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World.
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.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Time-space trade-offs for triangulating a simple polygon.
J. Comput. Geom., 2017

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.
Discret. Comput. Geom., 2017

Nearest-Neighbor Search Under Uncertainty.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Computing the Distance between Piecewise-Linear Bivariate Functions.
ACM Trans. Algorithms, 2016

Segmentation of Trajectories on Nonmonotone Criteria.
ACM Trans. Algorithms, 2016

Nearest-Neighbor Searching Under Uncertainty II.
ACM Trans. Algorithms, 2016

Distance-sensitive planar point location.
Comput. Geom., 2016

2014
Improved Bounds for the Union of Locally Fat Objects in the Plane.
SIAM J. Comput., 2014

Mutual witness proximity graphs.
Inf. Process. Lett., 2014

Witness Rectangle Graphs.
Graphs Comb., 2014

Quickly Placing a Point to Maximize Angles.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Computing Correlation between Piecewise-Linear Functions.
SIAM J. Comput., 2013

Witness Gabriel graphs.
Comput. Geom., 2013

How to cover a point set with a V-shape of minimum width.
Comput. Geom., 2013

On the Union Complexity of Diametral Disks.
Electron. J. Comb., 2013

Distance-Sensitive Planar Point Location.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Segmentation of Trajectories for Non-Monotone Criteria.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

How To Place a Point to Maximize Angles.
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.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Unions of Fat Convex Polytopes Have Short Skeletons.
Discret. Comput. Geom., 2012

Minimizing the error of linear separators on linearly inseparable data.
Discret. Appl. Math., 2012

2011
Connect the dot: Computing feed-links for network extension.
J. Spatial Inf. Sci., 2011

Lines Pinning Lines.
Discret. Comput. Geom., 2011

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

Witness (Delaunay) graphs.
Comput. Geom., 2011

Peeling Meshed Potatoes.
Algorithmica, 2011

Improved Bound for the Union of Fat Triangles.
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.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Approximate Halfspace Range Counting.
SIAM J. Comput., 2010

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes.
SIAM J. Comput., 2010

Optimal Triangulations of Points and Segments with Steiner Points.
Int. J. Comput. Geom. Appl., 2010

Computing similarity between piecewise-linear functions.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Small weak epsilon-nets.
Comput. Geom., 2009

Minimum-Cost Load-Balancing Partitions.
Algorithmica, 2009

Connect the Dot: Computing Feed-Links with Minimum Dilation.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Small-size epsilon-nets for axis-parallel rectangles and boxes.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
On Approximating the Depth and Related Problems.
SIAM J. Comput., 2008

A Generalization of Magic Squares with Applications to Digital Halftoning.
Theory Comput. Syst., 2008

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.
Comput. Geom., 2008

Sparse geometric graphs with small dilation.
Comput. Geom., 2008

Cutting cycles of rods in space: hardness and approximation.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Feed-links for network extensions.
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.
Proceedings of the Algorithms, 2008

2007
Optimal Triangulation with Steiner Points.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

On approximate halfspace range counting and relative epsilon-approximations.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

Largest Subsets of Triangles in a Triangulation.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Efficient algorithms for bichromatic separability.
ACM Trans. Algorithms, 2006

Polyline Fitting of Planar Points under Min-sum Criteria.
Int. J. Comput. Geom. Appl., 2006

On the Union of kappa-Round Objects in Three and Four Dimensions.
Discret. Comput. Geom., 2006

Cost prediction for ray shooting in octrees.
Comput. Geom., 2006

The Complexity of Diffuse Reflections in a Simple Polygon.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Fréchet Distance for Curves, Revisited.
Proceedings of the Algorithms, 2006

2005
Geometric Permutations Induced by Line Transversals through a Fixed Point.
Discret. Comput. Geom., 2005

Cutting Triangular Cycles of Lines in Space.
Discret. Comput. Geom., 2005

Incidences between Points and Circles in Three and Higher Dimensions.
Discret. Comput. Geom., 2005

Lines Avoiding Unit Balls in Three Dimensions.
Discret. Comput. Geom., 2005

Cost-driven octree construction schemes: an experimental study.
Comput. Geom., 2005

On geometric permutations induced by lines transversal through a fixed point.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Sparse Geometric Graphs with Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
Cell Complexities in Hyperplane Arrangements.
Discret. Comput. Geom., 2004

Distinct Distances in Three and Higher Dimensions.
Comb. Probab. Comput., 2004

On the number of views of translates of a cube and related problems.
Comput. Geom., 2004

On the union of kapa-round objects.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Facility Location on a Polyhedral Surface.
Discret. Comput. Geom., 2003

2002
A lower bound on Voronoi diagram complexity.
Inf. Process. Lett., 2002

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces.
Discret. Comput. Geom., 2002

Visibility Queries and Maintenance in Simple Polygons.
Discret. Comput. Geom., 2002

A Helly-type theorem for higher-dimensional transversals.
Comput. Geom., 2002

Cost prediction for ray shooting.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.
Discret. Comput. Geom., 2001

On the Number of Regular Vertices of the Union of Jordan Regions.
Discret. Comput. Geom., 2001

Polytopes in Arrangements.
Discret. Comput. Geom., 2001

Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells.
Discret. Comput. Geom., 2001

On the Complexity of Many Faces in Arrangements of Circles.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
On the Helly Number for Hyperplane Transversals to Unit Balls.
Discret. Comput. Geom., 2000

Approximation Algorithms for Minimum-Width Annuli and Shells.
Discret. Comput. Geom., 2000

On the Number of Views of Polyhedral Scenes.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
Approximating Minimum-Weight Triangulations in Three Dimensions.
Discret. Comput. Geom., 1999

Motion Planning for Multiple Robots.
Discret. Comput. Geom., 1999

Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.
Discret. Comput. Geom., 1999

Motion Planning for a Convex Polygon in a Polygonal Environment.
Discret. Comput. Geom., 1999

Approximation and Exact Algorithms for Minimum-Width Annuli and Shells.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Visibility with One Reflection.
Discret. Comput. Geom., 1998

Visibility with Multiple Reflections.
Discret. Comput. Geom., 1998

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%.
Discret. Comput. Geom., 1998

Minkowski-Type Theorems and Least-Squares Clustering.
Algorithmica, 1998

Facility Location on Terrains.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Visibility Queries in Simple Polygons and Applications.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
The Union of Convex Polyhedra in Three Dimensions.
SIAM J. Comput., 1997

On Translational Motion Planning of a Convex Polyhedron in 3-Space.
SIAM J. Comput., 1997

Computing Envelopes in Four Dimensions with Applications.
SIAM J. Comput., 1997

Star Unfolding of a Polytope with Applications.
SIAM J. Comput., 1997

The Common Exterior of Convex Polygons in the Plane.
Comput. Geom., 1997

Quasi-Planar Graphs Have a Linear Number of Edges.
Comb., 1997

Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Average-Case Ray Shooting and Minimum Weight Triangulations.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

On Levels in Arrangements of Lines, Segments, Planes, and Triangles.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1995
Visibility with Reflection.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Stabbing Triangulations by Lines in 3D.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

The complexity of a single face of a minkowski sum.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements.
J. Comb. Theory, Ser. A, 1994

Castles in the Air Revisited.
Discret. Comput. Geom., 1994

On the Number of Minimal 1-Steiner Trees.
Discret. Comput. Geom., 1994

Can Visibility Graphs Be Represented Compactly?.
Discret. Comput. Geom., 1994

Crossing Families.
Comb., 1994

On Translational Motion Planning in 3-Space.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
On the Zone of a Surface in a Hyperplane Arrangement.
Discret. Comput. Geom., 1993

An Invariant Property of Balls in Arrangements of Hyperplanes.
Discret. Comput. Geom., 1993

The Furthest-Site Geodesic Voronoi Diagram.
Discret. Comput. Geom., 1993

On Compatible Triangulations of Simple Polygons.
Comput. Geom., 1993

Selecting Distances in the Plane.
Algorithmica, 1993

The Union of Convex Polyhedra in Three Dimensions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Nonoverlap of the Star Unfolding.
Discret. Comput. Geom., 1992

Counting Facets and Incidences.
Discret. Comput. Geom., 1992

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

Minkowski-Type Theorems and Least-Squares Partitioning.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Minimum-Speed Motions.
Int. J. Robotics Res., 1991

Points and Triangles in the Plane and Halving Planes in Space.
Discret. Comput. Geom., 1991

Computing external farthest neighbors for a simple polygon.
Discret. Appl. Math., 1991

On the Zone of a Surface in a Hyperplane Arrangement.
Proceedings of the Algorithms and Data Structures, 1991

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

Star Unfolding of a Polytope with Applications (Extended Abstract).
Proceedings of the SWAT 90, 1990

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


  Loading...