The following pages link to Boris Aronov (Q359754):
Displaying 50 items.
- (Q178847) (redirect page) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Witness Gabriel graphs (Q359756) (← links)
- On the union complexity of diametral disks (Q396766) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Unions of fat convex polytopes have short skeletons (Q443910) (← links)
- The number of holes in the union of translates of a convex set in three dimensions (Q512258) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Lines pinning lines (Q629835) (← links)
- More Turán-type theorems for triangles in convex point sets (Q668054) (← links)
- Cell complexities in hyperplane arrangements (Q701778) (← links)
- Witness rectangle graphs (Q742595) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Minimum-cost load-balancing partitions (Q834581) (← links)
- On the union of \(\kappa\)-round objects in three and four dimensions (Q854705) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- Points and triangles in the plane and halving planes in space (Q1176320) (← links)
- Counting facets and incidences (Q1189286) (← links)
- Nonoverlap of the star unfolding (Q1199127) (← links)
- The number of edges of many faces in a line segment arrangement (Q1200271) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- On the zone of a surface in a hyperplane arrangement (Q1209841) (← links)
- Visibility with multiple reflections (Q1269452) (← links)
- Line transversals of balls and smallest enclosing cylinders in three dimensions (Q1289240) (← links)
- Approximating minimum-weight triangulations in three dimensions (Q1293672) (← links)
- Motion planning for a convex polygon in a polygonal environment (Q1302036) (← links)
- An invariant property of balls in arrangements of hyperplanes (Q1312192) (← links)
- On the sum of squares of cell complexities in hyperplane arrangements (Q1320395) (← links)
- Crossing families (Q1330788) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- Castles in the air revisited (Q1334929) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- The common exterior of convex polygons in the plane (Q1367170) (← links)
- Quasi-planar graphs have a linear number of edges (Q1375051) (← links)
- Visibility with one reflection (Q1389170) (← links)
- On the number of views of translates of a cube and related problems. (Q1428117) (← links)
- Facility location on a polyhedral surface (Q1434248) (← links)
- On the Helly number for hyperplane transversals to unit balls (Q1580738) (← links)
- Approximation algorithms for minimum-width annuli and shells (Q1591055) (← links)
- Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Incidences between points and circles in three and higher dimensions (Q1772129) (← links)
- Cost-driven octree construction schemes: An experimental study (Q1775782) (← links)
- Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces (Q1791018) (← links)
- Motion planning for multiple robots (Q1809508) (← links)
