Boris Aronov

According to our database1, Boris Aronov authored at least 135 papers between 1987 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

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

Resolving SINR Queries in a Dynamic Setting.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 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
Eliminating Depth Cycles among Triangles in Three Dimensions.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

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

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

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

Time-Space Trade-offs for Triangulating a Simple Polygon.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Almost tight bounds for eliminating depth cycles in three dimensions.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Batched Point Location in SINR Diagrams via Algebraic Tools.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

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

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

On the Union Complexity of Diametral Disks.
Electr. 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

Nearest neighbor searching under uncertainty II.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 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.
Discrete & Computational Geometry, 2012

Minimizing the error of linear separators on linearly inseparable data.
Discrete Applied Mathematics, 2012

Computing the distance between piecewise-linear bivariate functions.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

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

Lines Pinning Lines.
Discrete & Computational Geometry, 2011

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

Peeling Meshed Potatoes.
Algorithmica, 2011

Witness Rectangle Graphs.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

How to Cover a Point Set with a V-Shape of Minimum Width.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 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. Geometry 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

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
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
On the Union of kappa-Round Objects in Three and Four Dimensions.
Discrete & Computational Geometry, 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

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

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

Minimum-cost load-balancing partitions.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Geometric Permutations Induced by Line Transversals through a Fixed Point.
Discrete & Computational Geometry, 2005

Lines Avoiding Unit Balls in Three Dimensions.
Discrete & Computational Geometry, 2005

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

On approximating the depth and related problems.
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

Small weak epsilon nets.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Cell Complexities in Hyperplane Arrangements.
Discrete & Computational Geometry, 2004

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

Efficient algorithms for bichromatic separability.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A Generalization of Magic Squares with Applications to Digital Halftoning.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Polyline Fitting of Planar Points Under Min-sum Criteria.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

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

On lines avoiding unit balls in three dimensions.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Facility Location on a Polyhedral Surface.
Discrete & Computational Geometry, 2003

Distinct distances in three and higher dimensions.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Cutting triangular cycles of lines in space.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Cost-driven octree construction schemes: an experimental study.
Proceedings of the 19th ACM Symposium on Computational Geometry, 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.
Discrete & Computational Geometry, 2002

Visibility Queries and Maintenance in Simple Polygons.
Discrete & Computational Geometry, 2002

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

Incidences between points and circles in three and higher dimensions.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

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

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.
Discrete & Computational Geometry, 2000

Approximation Algorithms for Minimum-Width Annuli and Shells.
Discrete & Computational Geometry, 2000

Exact and approximation algorithms for minimum-width cylindrical shells.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

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

A Helly-type theorem for hyperplane transversals to well-separated convex sets.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Approximating Minimum-Weight Triangulations in Three Dimensions.
Discrete & Computational Geometry, 1999

Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.
Discrete & Computational Geometry, 1999

Motion Planning for a Convex Polygon in a Polygonal Environment.
Discrete & Computational Geometry, 1999

Polytopes in Arrangements.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 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.
Discrete & Computational Geometry, 1998

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%.
Discrete & Computational Geometry, 1998

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

On the Number of Regular Vertices of the Union of Jordan Regions.
Proceedings of the Algorithm Theory, 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

Motion Planning for Multiple Robots.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Results on k-Sets and j-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

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

The Common Exterior of Convex Polygons in the Plane.
Comput. Geom., 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

1996
Visibility with Multiple Reflections.
Proceedings of the Algorithm Theory, 1996

1995
Quasi-Planar Graphs Have a Linear Number of Edges.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 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 Number of Minimal 1-Steiner Trees.
Discrete & Computational Geometry, 1994

Can Visibility Graphs Be Represented Compactly?.
Discrete & Computational Geometry, 1994

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

Computing Envelopes in Four Dimensions with Applications.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
On the Zone of a Surface in a Hyperplane Arrangement.
Discrete & Computational Geometry, 1993

An Invariant Property of Balls in Arrangements of Hyperplanes.
Discrete & Computational Geometry, 1993

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

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

Can Visibility Graphs be Represented Compactly?
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Counting Facets and Incidences.
Discrete & Computational Geometry, 1992

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

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

Castles in the Air Revisited.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

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

Points and Triangles in the Plane and Halving Planes in Space.
Discrete & Computational Geometry, 1991

Computing external farthest neighbors for a simple polygon.
Discrete Applied Mathematics, 1991

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

Nonoverlap of the Star Unfolding.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

On the Sum of Squares of Cell Complexities in Hyperplane Arrangements.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Crossing Families.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

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

Points and Triangles in the Plane and Halving Planes in Space.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Selecting Distances in the Plane.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1988
Triangles in Space or Building (and Analyzing) Castles in the Air.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

The Furthest-Site Geodesic Voronoi Diagram.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987


  Loading...