| Publication | Date of Publication | Type |
|---|
| The partition technique for overlays of envelopes | 2026-05-29 | Paper |
| Coresets forweighted facilities and their applications | 2026-05-29 | Paper |
| Lower envelopes of surface patches in 3-space | 2026-05-26 | Paper |
| Segment proximity graphs and nearest neighbor queries amid disjoint segments | 2026-05-26 | Paper |
| Near-linear algorithms for visibility graphs over a 1.5-dimensional terrain | 2026-05-26 | Paper |
| On the complexity of many faces in arrangements of circles | 2026-05-08 | Paper |
| On ray shooting for triangles in 3-space and related problems | 2026-04-27 | Paper |
| On rich lenses in planar arrangements of circles and related problems | 2026-04-27 | Paper |
| Throwing a sofa through the window | 2026-04-27 | Paper |
| On rich points and incidences with restricted sets of lines in 3-space | 2026-04-27 | Paper |
| Semi-algebraic off-line range searching and biclique partitions in the plane | 2025-11-24 | Paper |
Covering points by hyperplanes and related problems
SIAM Journal on Discrete Mathematics | 2025-11-21 | Paper |
Intersection queries for flat semi-algebraic objects in three dimensions and related problems
ACM Transactions on Algorithms | 2025-10-01 | Paper |
| Incidences between points and lines in \(\mathbb{R}^4\) | 2025-08-05 | Paper |
Improved algebraic degeneracy testing
Discrete & Computational Geometry | 2025-07-07 | Paper |
| Intersection searching amid tetrahedra in 4-space and efficient continuous collision detection | 2025-06-19 | Paper |
| On range searching with semialgebraic sets. II | 2025-05-05 | Paper |
| Improved bounds for geometric permutations | 2025-04-29 | Paper |
Intersection searching amid tetrahedra in four dimensions
Discrete & Computational Geometry | 2025-02-19 | Paper |
| The unweighted and weighted reverse shortest path problem for disk graphs | 2025-01-06 | Paper |
| Vertical decomposition in 3D and 4D with applications to line nearest-neighbor searching in 3D | 2024-11-28 | Paper |
| Near-optimal min-sum motion planning for two square robots in a polygonal environment | 2024-11-28 | Paper |
Decomposing the complement of the union of cubes and boxes in three dimensions
Discrete & Computational Geometry | 2024-10-25 | Paper |
| Improved algebraic degeneracy testing | 2024-10-16 | Paper |
Eli Goodman (1933--2021) and Ricky Pollack (1935--2018)
Notices of the American Mathematical Society | 2024-09-26 | Paper |
| On reverse shortest paths in geometric proximity graphs | 2024-09-11 | Paper |
| Intersection queries for flat semi-algebraic objects in three dimensions and related problems | 2024-05-14 | Paper |
| Covering points by hyperplanes and related problems | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788424 (Why is no real title available?) | 2024-01-15 | Paper |
| Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model | 2024-01-15 | Paper |
Throwing a sofa through the window
Discrete & Computational Geometry | 2023-12-21 | Paper |
On reverse shortest paths in geometric proximity graphs
Computational Geometry | 2023-11-23 | Paper |
| Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. | 2023-11-02 | Paper |
| Incidences between points and curves with almost two degrees of freedom | 2023-11-02 | Paper |
How to Find a Point in the Convex Hull Privately
(available as arXiv preprint) | 2023-11-02 | Paper |
Bottleneck matching in the plane
Computational Geometry | 2023-06-26 | Paper |
Space-aware reconfiguration
Discrete & Computational Geometry | 2023-05-12 | Paper |
Erratum: “Breaking the 3/2 barrier for unit distances in three dimensions”
IMRN. International Mathematics Research Notices | 2023-02-10 | Paper |
Computing the smallest k-enclosing circle and related problems
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Time and space efficient collinearity indexing
Computational Geometry | 2023-01-09 | Paper |
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Computing depth orders and related problems
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
On the number of regular vertices of the union of Jordan regions
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
Discrete & Computational Geometry | 2022-12-08 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
On rich points and incidences with restricted sets of lines in 3-space
(available as arXiv preprint) | 2022-10-31 | Paper |
Dynamic data structures for fat objects and their applications
Lecture Notes in Computer Science | 2022-08-19 | Paper |
A combinatorial bound for linear programming and related problems
STACS 92 | 2022-08-18 | Paper |
On ray shooting for triangles in 3-space and related problems
SIAM Journal on Computing | 2022-07-22 | Paper |
| scientific article; zbMATH DE number 7561404 (Why is no real title available?) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561380 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559262 (Why is no real title available?) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559208 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Triangles and girth in disk graphs and transmission graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
Counting and Cutting Rich Lenses in Arrangements of Circles
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
The maximum-level vertex in an arrangement of lines
Discrete & Computational Geometry | 2022-03-21 | Paper |
Incidences between points and curves with almost two degrees of freedom
Journal of Combinatorial Theory. Series A | 2022-02-24 | Paper |
Space-aware reconfiguration
Algorithmic Foundations of Robotics XIV | 2021-09-20 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-07-28 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Union of hypercubes and 3D Minkowski sums with random sizes
Discrete & Computational Geometry | 2021-04-29 | Paper |
On the complexity of the \(k\)-level in arrangements of pseudoplanes
Discrete Mathematics | 2021-04-28 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
SIAM Journal on Computing | 2021-04-14 | Paper |
Output sensitive algorithms for approximate incidences and their applications
Computational Geometry | 2021-01-07 | Paper |
Output sensitive algorithms for approximate incidences and their applications
Computational Geometry | 2021-01-07 | Paper |
| On rich lenses in planar arrangements of circles and related problems | 2020-12-07 | Paper |
Dominance product and high-dimensional closest pair under \(L_\infty\)
(available as arXiv preprint) | 2020-11-25 | Paper |
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
Discrete & Computational Geometry | 2020-10-23 | Paper |
Eliminating depth cycles among triangles in three dimensions
Discrete & Computational Geometry | 2020-10-23 | Paper |
Algebraic techniques in geometry. The 10th anniversary
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| Incidences with curves in three dimensions | 2020-07-06 | Paper |
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
Discrete & Computational Geometry | 2020-06-16 | Paper |
| Output sensitive algorithms for approximate incidences and their applications | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7205030 (Why is no real title available?) | 2020-05-27 | Paper |
Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
(available as arXiv preprint) | 2020-05-27 | Paper |
| Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7204982 (Why is no real title available?) | 2020-05-27 | Paper |
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Computational Geometry | 2019-10-25 | Paper |
| Incidences between points and lines in three dimensions | 2019-06-12 | Paper |
A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
Discrete & Computational Geometry | 2019-05-21 | Paper |
Reporting neighbors in high-dimensional Euclidean space
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Computing the discrete Fréchet distance in subquadratic time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications | 2019-05-10 | Paper |
| Line transversals of convex polyhedra in \(\mathbb{R}^3\) | 2019-05-06 | Paper |
Dynamic time warping and geometric edit distance: breaking the quadratic barrier
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Incidences between points and circles in three and higher dimensions
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Polyhedral Voronoi diagrams of polyhedra in three dimensions
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Lenses in arrangements of pseudo-circles and their applications
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Three dimensional Euclidean Voronoi diagrams of lines with a fixed number of orientations
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
The Elekes-Szabó theorem in four dimensions
Israel Journal of Mathematics | 2018-11-13 | Paper |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Algorithms for center and Tverberg points
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| A nearly quadratic bound for the decision tree complexity of k-SUM | 2018-08-13 | Paper |
Partial-matching RMS distance under translation: combinatorics and algorithms
Algorithmica | 2018-07-25 | Paper |
The number of unit-area triangles in the plane: theme and variation
Combinatorica | 2018-07-23 | Paper |
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Eliminating depth cycles among triangles in three dimensions
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Approximating the k-level in three-dimensional plane arrangements
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Homotheties and incidences
Discrete Mathematics | 2018-05-24 | Paper |
Polynomials vanishing on grids: the Elekes-Rónyai problem revisited
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
On triple intersections of three families of unit circles
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Incidences between points and lines in R4
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Finding the largest disk containing a query point in logarithmic time with linear storage (extended abstract)
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Almost tight bounds for eliminating depth cycles in three dimensions
Discrete & Computational Geometry | 2018-04-20 | Paper |
| Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time | 2018-03-15 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
(available as arXiv preprint) | 2018-03-15 | Paper |
Distinct distances between points and lines
Computational Geometry | 2018-02-28 | Paper |
Incidences between points and lines on two- and three-dimensional varieties
Discrete & Computational Geometry | 2018-02-28 | Paper |
Approximating the k-Level in Three-Dimensional Plane Arrangements
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Distinct distances between a collinear set and an arbitrary set of points
Discrete Mathematics | 2017-10-24 | Paper |
An improved bound on the number of unit area triangles
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited | 2017-10-10 | Paper |
Incidences between points and lines in three dimensions
(available as arXiv preprint) | 2017-10-10 | Paper |
The number of unit-area triangles in the plane: theme and variations
(available as arXiv preprint) | 2017-10-10 | Paper |
Distinct distances from three points
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Improved bounds for incidences between points and circles
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Almost tight bounds for eliminating depth cycles in three dimensions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Improved bound for the union of fat triangles | 2017-09-29 | Paper |
New results on shortest paths in three dimensions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
On empty convex polygons in a planar point set
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
On lines avoiding unit balls in three dimensions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
A tight bound for the number of different directions in three dimensions
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the number of congruent simplices in a point
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Algorithms for center and Tverberg points
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the union of -round objects
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The union of congruent cubes in three dimensions
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
An improved bound for <i>k</i> -sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
The Clarkson-Shor technique revisited and extended
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Balanced lines, halving triangles, and the generalized lower bound theorem
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Curve-sensitive cuttings
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Counting and representing intersections among triangles in three dimensions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the number of unit-area triangles spanned by convex grids in the plane
Computational Geometry | 2017-06-29 | Paper |
Cutting algebraic curves into pseudo-segments and applications
Journal of Combinatorial Theory. Series A | 2017-05-29 | Paper |
Incidences between points and lines in \({\mathbb {R}}^4\)
Discrete & Computational Geometry | 2017-05-11 | Paper |
Finding the largest disk containing a query point in logarithmic time with linear storage
(available as arXiv preprint) | 2017-03-30 | Paper |
Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
Duke Mathematical Journal | 2017-01-25 | Paper |
Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited
Duke Mathematical Journal | 2017-01-25 | Paper |
Incidences with curves in \(\mathbb{R}^d\)
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
Polynomials vanishing on grids: the Elekes-Rónyai problem revisited
American Journal of Mathematics | 2016-08-22 | Paper |
In memory of Jacob Schwartz
Notices of the American Mathematical Society | 2016-06-15 | Paper |
Generalizations of the Szemerédi-Trotter theorem
Discrete & Computational Geometry | 2016-05-12 | Paper |
| Distinct and repeated distances on a surface and incidences between points and spheres | 2016-04-06 | Paper |
| Incidences between points on a variety and planes in R^3 | 2016-03-15 | Paper |
On triple intersections of three families of unit circles
Discrete & Computational Geometry | 2016-02-03 | Paper |
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
Discrete & Computational Geometry | 2016-02-03 | Paper |
On the union of fat tetrahedra in three dimensions
Journal of the ACM | 2015-12-07 | Paper |
Incidences with curves in \(\mathbb{R}^{d}\)
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Weak ε-nets and interval chains
Journal of the ACM | 2015-11-11 | Paper |
| scientific article; zbMATH DE number 6472624 (Why is no real title available?) | 2015-08-14 | Paper |
| Output-sensitive construction of the union of triangles | 2015-08-03 | Paper |
| Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks | 2015-08-03 | Paper |
Geometrically aware communication in random wireless networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM | 2015-08-01 | Paper |
Distinct distances on two lines
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Improved bounds on weak ε-nets for convex sets
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Sets with few distinct distances do not have heavy lines
Discrete Mathematics | 2015-04-29 | Paper |
Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Union of random minkowski sums and network vulnerability analysis
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
| Incidences between points and lines on a two-dimensional variety | 2015-01-13 | Paper |
| scientific article; zbMATH DE number 6381708 (Why is no real title available?) | 2014-12-18 | Paper |
Hausdorff distance under translation for points and balls
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Reporting neighbors in high-dimensional Euclidean space
SIAM Journal on Computing | 2014-11-14 | Paper |
Union of random Minkowski sums and network vulnerability analysis
Discrete & Computational Geometry | 2014-11-14 | Paper |
| Online conflict-free coloring for intervals | 2014-10-13 | Paper |
| Ray shooting amid balls, farthest point from a line, and range emptiness searching | 2014-10-13 | Paper |
| The interface between computational and combinatorial geometry | 2014-10-13 | Paper |
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
Algorithms - ESA 2014 | 2014-10-08 | Paper |
A note on distinct distances in rectangular lattices
Discrete Mathematics | 2014-09-04 | Paper |
On the union complexity of diametral disks
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Finding the largest empty disk containing a query point
International Journal of Computational Geometry & Applications | 2014-08-11 | Paper |
Finding the maximal empty disk containing a query point
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Improved bounds for the union of locally fat objects in the plane
SIAM Journal on Computing | 2014-07-30 | Paper |
Computing the discrete Fréchet distance in subquadratic time
SIAM Journal on Computing | 2014-07-30 | Paper |
On range searching with semialgebraic sets. II.
SIAM Journal on Computing | 2014-04-11 | Paper |
On degrees in random triangulations of point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Incidences in three dimensions and distinct distances in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Counting plane graphs: cross-graph charging schemes
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Counting plane graphs: flippability and its applications
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
| On lattices, distinct distances, and the Elekes-Sharir framework | 2013-06-02 | Paper |
The 2-center problem in three dimensions
Computational Geometry | 2013-04-29 | Paper |
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Journal of Combinatorial Theory. Series A | 2013-04-15 | Paper |
Counting Plane Graphs: Cross-Graph Charging Schemes
Graph Drawing | 2013-04-03 | Paper |
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
Discrete & Computational Geometry | 2012-10-15 | Paper |
Unit distances in three dimensions
Combinatorics, Probability and Computing | 2012-09-04 | Paper |
Improved bounds for geometric permutations
SIAM Journal on Computing | 2012-08-10 | Paper |
Near-linear approximation algorithms for geometric hitting sets
Algorithmica | 2012-04-26 | Paper |
Optimal cover of points by disks in a simple polygon
SIAM Journal on Computing | 2012-03-15 | Paper |
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing | 2011-11-07 | Paper |
Non-Degenerate Spheres in Three Dimensions
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
Incidences in three dimensions and distinct distances in the plane
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
Counting plane graphs: flippability and its applications
Lecture Notes in Computer Science | 2011-08-12 | Paper |
On degrees in random triangulations of point sets
Journal of Combinatorial Theory. Series A | 2011-07-07 | Paper |
Counting triangulations of planar point sets
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Counting triangulations of planar point sets
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On lines, joints, and incidences in three dimensions
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
Small-size -nets for axis-parallel rectangles and boxes
SIAM Journal on Computing | 2011-04-04 | Paper |
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing | 2011-04-04 | Paper |
Approximate halfspace range counting
SIAM Journal on Computing | 2011-04-04 | Paper |
Relative (p, )-approximations in geometry
Discrete & Computational Geometry | 2011-03-31 | Paper |
The overlay of minimization diagrams in a randomized incremental construction
Discrete & Computational Geometry | 2011-03-31 | Paper |
A kinetic triangulation scheme for moving points in the plane
Computational Geometry | 2011-03-25 | Paper |
Range minima queries with respect to a random permutation, and approximate range counting
Discrete & Computational Geometry | 2011-03-10 | Paper |
An Improved Bound for <i>k</i>-Sets in Four Dimensions
Combinatorics, Probability and Computing | 2011-01-17 | Paper |
On lines and joints
Discrete & Computational Geometry | 2010-11-08 | Paper |
An improved bound on the number of unit area triangles
Discrete & Computational Geometry | 2010-11-08 | Paper |
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on Computational Science IX | 2010-11-02 | Paper |
Guarding a terrain by two watchtowers
Algorithmica | 2010-09-16 | Paper |
Optimal cover of points by disks in a simple polygon
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
On the number of crossing-free matchings, (cycles, and partitions)
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Distinct distances in three and higher dimensions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764800 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5712306 (Why is no real title available?) | 2010-05-26 | Paper |
Extremal configurations and levels in pseudoline arrangements.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Ray shooting and stone throwing
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Extremal problems on triangle areas in two and three dimensions
Journal of Combinatorial Theory. Series A | 2009-11-26 | Paper |
Linear data structures for fast ray-shooting amidst convex polyhedra
Algorithmica | 2009-08-27 | Paper |
Efficient Colored Orthogonal Range Counting
SIAM Journal on Computing | 2009-06-22 | Paper |
On regular vertices of the union of planar convex objects
Discrete & Computational Geometry | 2009-05-13 | Paper |
On overlays and minimization diagrams
Discrete & Computational Geometry | 2009-04-27 | Paper |
| scientific article; zbMATH DE number 5542484 (Why is no real title available?) | 2009-04-14 | Paper |
| An optimal-time algorithm for shortest paths on a convex polytope in three dimensions | 2009-04-14 | Paper |
The Minkowski sum of a simple polygon and a segment
Information Processing Letters | 2009-03-23 | Paper |
Eppstein's bound on intersecting triangles revisited
Journal of Combinatorial Theory. Series A | 2009-03-04 | Paper |
On planar intersection graphs with forbidden subgraphs
Journal of Graph Theory | 2009-02-20 | Paper |
| Computing the volume of the union of cubes | 2009-02-12 | Paper |
| Similar simplices in a d-dimensional point set | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5507867 (Why is no real title available?) | 2009-02-12 | Paper |
On approximate halfspace range counting and relative epsilon-approximations
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
Bi-criteria linear-time approximations for generalized k-mean/median/center
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
On regular vertices on the union of planar objects
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506188 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506218 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506231 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506197 (Why is no real title available?) | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506192 (Why is no real title available?) | 2009-02-10 | Paper |
| Combinatorial geometry and its algorithmic applications. The Alcalá lectures | 2009-01-08 | Paper |
Stabbing Convex Polygons with a Segment or a Polygon
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Arrangements in Geometry: Recent Advances and Challenges
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Efficient algorithms for maximum regression depth
Discrete & Computational Geometry | 2008-08-19 | Paper |
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
On the performance of the ICP algorithm
Computational Geometry | 2008-07-29 | Paper |
| State of the union (of geometric objects) | 2008-07-21 | Paper |
Computing a Center-Transversal Line
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Discrete & Computational Geometry | 2008-04-16 | Paper |
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
Discrete & Computational Geometry | 2008-04-16 | Paper |
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Discrete & Computational Geometry | 2007-12-19 | Paper |
Online Conflict‐Free Coloring for Intervals
SIAM Journal on Computing | 2007-10-22 | Paper |
On the Number of Crossing‐Free Matchings, Cycles, and Partitions
SIAM Journal on Computing | 2007-06-26 | Paper |
Computing Maximally Separated Sets in the Plane
SIAM Journal on Computing | 2007-06-26 | Paper |
A single cell in an arrangement of convex polyhedra in R^3
Discrete & Computational Geometry | 2007-02-14 | Paper |
Kinetic and dynamic data structures for convex hulls and upper envelopes
Computational Geometry | 2006-12-14 | Paper |
On the union of -round objects in three and four dimensions
Discrete & Computational Geometry | 2006-12-06 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
On graphs that do not contain the cube and related problems
Combinatorica | 2006-06-27 | Paper |
Repeated Angles in Three and Four Dimensions
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
On empty convex polygons in a planar point set
Journal of Combinatorial Theory. Series A | 2006-04-28 | Paper |
k-sets in four dimensions
Discrete & Computational Geometry | 2006-03-21 | Paper |
Minkowski sums of monotone and general simple polygons
Discrete & Computational Geometry | 2006-03-21 | Paper |
| Incidences | 2006-03-09 | Paper |
Topological graphs with no large grids
Graphs and Combinatorics | 2005-11-24 | Paper |
Counting and representing intersections among triangles in three dimensions
Computational Geometry | 2005-11-01 | Paper |
Lines avoiding unit balls in three dimensions
Discrete & Computational Geometry | 2005-11-01 | Paper |
Crossing patterns of semi-algebraic sets
Journal of Combinatorial Theory. Series A | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2209744 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2209708 (Why is no real title available?) | 2005-09-28 | Paper |
Pseudo-Line Arrangements: Duality, Algorithms, and Applications
SIAM Journal on Computing | 2005-09-16 | Paper |
Top-Down Analysis of Path Compression
SIAM Journal on Computing | 2005-09-16 | Paper |
Curve-Sensitive Cuttings
SIAM Journal on Computing | 2005-09-16 | Paper |
Output-Sensitive Construction of the Union of Triangles
SIAM Journal on Computing | 2005-09-16 | Paper |
Ray shooting and stone throwing with near-linear storage
Computational Geometry | 2005-05-12 | Paper |
Cutting triangular cycles of lines in space
Discrete & Computational Geometry | 2005-04-15 | Paper |
Incidences between points and circles in three and higher dimensions
Discrete & Computational Geometry | 2005-04-15 | Paper |
An improved bound for joints in arrangements of lines in space
Discrete & Computational Geometry | 2005-04-15 | Paper |
| scientific article; zbMATH DE number 2145241 (Why is no real title available?) | 2005-03-14 | Paper |
The Simplex Algorithm in Dimension Three
SIAM Journal on Computing | 2005-02-21 | Paper |
Cell complexities in hyperplane arrangements
Discrete & Computational Geometry | 2004-12-16 | Paper |
| scientific article; zbMATH DE number 2119741 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119742 (Why is no real title available?) | 2004-11-29 | Paper |
On the number of directions determined by a three-dimensional points set
Journal of Combinatorial Theory. Series A | 2004-10-14 | Paper |
| scientific article; zbMATH DE number 2103167 (Why is no real title available?) | 2004-09-24 | Paper |
Point–Line Incidences in Space
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Distinct Distances in Three and Higher Dimensions
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
Discrete & Computational Geometry | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2089216 (Why is no real title available?) | 2004-08-12 | Paper |
On the number of views of translates of a cube and related problems.
Computational Geometry | 2004-03-14 | Paper |
Polyhedral Voronoi diagrams of polyhedra in three dimensions
Discrete & Computational Geometry | 2004-03-11 | Paper |
The Clarkson–Shor Technique Revisited and Extended
Combinatorics, Probability and Computing | 2004-02-20 | Paper |
Speeding up the incremental construction of the union of geometric objects in practice.
Computational Geometry | 2004-01-23 | Paper |
The union of congruent cubes in three dimensions
Discrete & Computational Geometry | 2003-08-21 | Paper |
On neighbors in geometric permutations.
Discrete Mathematics | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1947380 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947415 (Why is no real title available?) | 2003-07-08 | Paper |
The Partition Technique for Overlays of Envelopes
SIAM Journal on Computing | 2003-06-19 | Paper |
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
SIAM Journal on Computing | 2003-06-19 | Paper |
Cutting circles into pseudo-segments and improved bounds for incidences
Discrete & Computational Geometry | 2003-03-17 | Paper |
The number of congruent simplices in a point set
Discrete & Computational Geometry | 2003-03-17 | Paper |
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry | 2003-03-10 | Paper |
| The Random Edge Rule on Three-Dimensional Linear Programs | 2003-01-09 | Paper |
| scientific article; zbMATH DE number 1830727 (Why is no real title available?) | 2002-11-18 | Paper |
On the number of regular vertices of the union of Jordan regions
Discrete & Computational Geometry | 2002-11-04 | Paper |
The 2-center problem with obstacles
Journal of Algorithms | 2002-10-02 | Paper |
Radial points in the plane
European Journal of Combinatorics | 2002-08-21 | Paper |
Exact and approximation algorithms for minimum-width cylindrical shells
Discrete & Computational Geometry | 2002-07-22 | Paper |
An improved bound for \(k\)-sets in three dimensions
Discrete & Computational Geometry | 2002-07-10 | Paper |
On the complexity of arrangements of circles in the plane
Discrete & Computational Geometry | 2002-02-07 | Paper |
| Online point location in planar arrangements and its applications | 2002-01-30 | Paper |
Online point location in planar arrangements and its applications
Discrete & Computational Geometry | 2002-01-17 | Paper |
Penetration depth of two convex polytopes in 3D
Nordic Journal of Computing | 2002-01-17 | Paper |
Approximation algorithms for minimum-width annuli and shells
Discrete & Computational Geometry | 2001-08-16 | Paper |
| scientific article; zbMATH DE number 1617270 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1445343 (Why is no real title available?) | 2001-01-29 | Paper |
Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions
Discrete & Computational Geometry | 2000-12-19 | Paper |
| scientific article; zbMATH DE number 1424290 (Why is no real title available?) | 2000-11-12 | Paper |
Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)
Discrete & Computational Geometry | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1500639 (Why is no real title available?) | 2000-09-04 | Paper |
Dynamic data structures for fat objects and their applications
Computational Geometry | 2000-05-08 | Paper |
On the complexity of the union of fat convex objects in the plane
Discrete & Computational Geometry | 2000-03-23 | Paper |
| scientific article; zbMATH DE number 1424289 (Why is no real title available?) | 2000-03-23 | Paper |
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
SIAM Journal on Computing | 2000-03-19 | Paper |
On the boundary of the union of planar convex sets
Discrete & Computational Geometry | 1999-12-06 | Paper |
| scientific article; zbMATH DE number 1182933 (Why is no real title available?) | 1999-11-08 | Paper |
Motion planning for a convex polygon in a polygonal environment
Discrete & Computational Geometry | 1999-09-12 | Paper |
| scientific article; zbMATH DE number 1305388 (Why is no real title available?) | 1999-06-17 | Paper |
Line transversals of balls and smallest enclosing cylinders in three dimensions
Discrete & Computational Geometry | 1999-05-27 | Paper |
Partial surface matching by using directed footprints
Computational Geometry | 1999-05-03 | Paper |
The discrete 2-center problem
Discrete & Computational Geometry | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1241850 (Why is no real title available?) | 1999-01-18 | Paper |
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
Journal of Algorithms | 1999-01-17 | Paper |
On the Number of Incidences Between Points and Curves
Combinatorics, Probability and Computing | 1998-11-22 | Paper |
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces
Discrete & Computational Geometry | 1998-07-27 | Paper |
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
Discrete & Computational Geometry | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1142297 (Why is no real title available?) | 1998-05-04 | Paper |
Largest placement of one convex polygon inside another
Discrete & Computational Geometry | 1998-03-11 | Paper |
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM | 1998-02-17 | Paper |
The common exterior of convex polygons in the plane
Computational Geometry | 1998-02-16 | Paper |
Computing Envelopes in Four Dimensions with Applications
SIAM Journal on Computing | 1998-02-10 | Paper |
The Union of Convex Polyhedra in Three Dimensions
SIAM Journal on Computing | 1998-02-10 | Paper |
On Translational Motion Planning of a Convex Polyhedron in 3-Space
SIAM Journal on Computing | 1998-02-10 | Paper |
An Expander-Based Approach to Geometric Optimization
SIAM Journal on Computing | 1998-02-10 | Paper |
Quasi-planar graphs have a linear number of edges
Combinatorica | 1998-01-05 | Paper |
A near-linear algorithm for the planar 2-center problem
Discrete & Computational Geometry | 1997-08-24 | Paper |
Coordinated motion planning for two independent robots
Annals of Mathematics and Artificial Intelligence | 1997-07-07 | Paper |
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 1003238 (Why is no real title available?) | 1997-04-23 | Paper |
On critical orientations in the Kedem-Sharir motion planning algorithm
Discrete & Computational Geometry | 1997-03-23 | Paper |
Filling gaps in the boundary of a polyhedron
Computer Aided Geometric Design | 1997-02-28 | Paper |
Excess in arrangements of segments
Information Processing Letters | 1997-02-27 | Paper |
A subexponential bound for linear programming
Algorithmica | 1997-02-18 | Paper |
Ray Shooting Amidst Convex Polygons in 2D
Journal of Algorithms | 1996-12-08 | Paper |
Efficient randomized algorithms for some geometric optimization problems
Discrete & Computational Geometry | 1996-11-26 | Paper |
A near-linear algorithm for the planar segment-center problem
Discrete & Computational Geometry | 1996-11-26 | Paper |
Computing depth orders for fat objects and related problems
Computational Geometry | 1996-11-10 | Paper |
Robot motion planning
Communications on Pure and Applied Mathematics | 1996-11-05 | Paper |
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
Discrete & Computational Geometry | 1996-10-13 | Paper |
| scientific article; zbMATH DE number 910875 (Why is no real title available?) | 1996-08-22 | Paper |
Piecewise-Linear Interpolation between Polygonal Slices
Computer Vision and Image Understanding | 1996-07-31 | Paper |
The overlay of lower envelopes and its applications
Discrete & Computational Geometry | 1996-06-27 | Paper |
Almost tight upper bounds for the single cell and zone problems in the three dimensions
Discrete & Computational Geometry | 1996-06-23 | Paper |
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
SIAM Journal on Computing | 1996-06-05 | Paper |
Lines in space: Combinatorics and algorithms
Algorithmica | 1996-05-27 | Paper |
| scientific article; zbMATH DE number 871907 (Why is no real title available?) | 1996-04-28 | Paper |
| scientific article; zbMATH DE number 797447 (Why is no real title available?) | 1996-03-27 | Paper |
Applications of Parametric Searching in Geometric Optimization
Journal of Algorithms | 1995-11-22 | Paper |
Common tangents and common transversals
Advances in Mathematics | 1995-11-12 | Paper |
| scientific article; zbMATH DE number 739019 (Why is no real title available?) | 1995-09-19 | Paper |
Almost tight upper bounds for lower envelopes in higher dimensions
Discrete & Computational Geometry | 1995-08-27 | Paper |
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
Discrete & Computational Geometry | 1995-08-27 | Paper |
Algorithms for bichromatic line-segment problems and polyhedral terrains
Algorithmica | 1995-08-20 | Paper |
Vertical decomposition of arrangements of hyperplanes in four dimensions
Discrete & Computational Geometry | 1995-08-13 | Paper |
An elementary approach to lower bounds in geometric discrepancy
Discrete & Computational Geometry | 1995-07-02 | Paper |
| scientific article; zbMATH DE number 742950 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 742952 (Why is no real title available?) | 1995-04-11 | Paper |
Selecting Heavily Covered Points
SIAM Journal on Computing | 1995-04-06 | Paper |
Improved bounds on weak \(\varepsilon\)-nets for convex sets
Discrete & Computational Geometry | 1995-04-03 | Paper |
| scientific article; zbMATH DE number 431984 (Why is no real title available?) | 1995-03-29 | Paper |
| scientific article; zbMATH DE number 732977 (Why is no real title available?) | 1995-03-12 | Paper |
On the union of fat wedges and separating a collection of segments by a line
Computational Geometry | 1994-11-29 | Paper |
| scientific article; zbMATH DE number 437551 (Why is no real title available?) | 1994-11-29 | Paper |
Motion planning in the presence of moving obstacles
Journal of the ACM | 1994-11-03 | Paper |
Castles in the air revisited
Discrete & Computational Geometry | 1994-09-26 | Paper |
On the number of views of polyhedral terrains
Discrete & Computational Geometry | 1994-09-26 | Paper |
\(k\)-sets and random hulls
Combinatorica | 1994-08-22 | Paper |
Ray shooting in polygons using geodesic triangulations
Algorithmica | 1994-08-10 | Paper |
On joints in arrangements of lines in space and related problems
Journal of Combinatorial Theory. Series A | 1994-08-09 | Paper |
Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines''
Information Processing Letters | 1994-08-03 | Paper |
Computing the smallest k-enclosing circle and related problems
Computational Geometry | 1994-08-03 | Paper |
Extremal polygon containment problems
Computational Geometry | 1994-07-21 | Paper |
On the sum of squares of cell complexities in hyperplane arrangements
Journal of Combinatorial Theory. Series A | 1994-06-06 | Paper |
An improved technique for output-sensitive hidden surface removal
Algorithmica | 1994-05-05 | Paper |
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing | 1994-04-27 | Paper |
Computing a Segment Center for a Planar Point Set
Journal of Algorithms | 1994-04-20 | Paper |
Computing a Face in an Arrangement of Line Segments and Related Problems
SIAM Journal on Computing | 1994-02-24 | Paper |
An invariant property of balls in arrangements of hyperplanes
Discrete & Computational Geometry | 1994-01-19 | Paper |
Optimal slope selection via expanders
Information Processing Letters | 1993-11-15 | Paper |
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection
Computational Geometry | 1993-11-01 | Paper |
| scientific article; zbMATH DE number 432847 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 432848 (Why is no real title available?) | 1993-10-20 | Paper |
Counting Circular Arc Intersections
SIAM Journal on Computing | 1993-10-10 | Paper |
Diameter, width, closest line pair, and parametric searching
Discrete & Computational Geometry | 1993-09-30 | Paper |
CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
Selecting distances in the plane
Algorithmica | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177830 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176772 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177563 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177534 (Why is no real title available?) | 1993-05-18 | Paper |
On the Zone Theorem for Hyperplane Arrangements
SIAM Journal on Computing | 1993-05-17 | Paper |
Efficient hidden surface removal for objects with small union size
Computational Geometry | 1993-05-16 | Paper |
The upper envelope of Voronoi surfaces and its applications
Discrete & Computational Geometry | 1993-05-16 | Paper |
On the zone of a surface in a hyperplane arrangement
Discrete & Computational Geometry | 1993-05-16 | Paper |
Circle Shooting in a Simple Polygon
Journal of Algorithms | 1993-05-16 | Paper |
Quasi-optimal upper bounds for simplex range searching and new zone theorems
Algorithmica | 1993-01-17 | Paper |
The number of edges of many faces in a line segment arrangement
Combinatorica | 1993-01-17 | Paper |
Applications of a new space-partitioning technique
Discrete & Computational Geometry | 1992-12-14 | Paper |
Counting and cutting cycles of lines and rods in space
Computational Geometry | 1992-09-27 | Paper |
Off-line dynamic maintenance of the width of a planar point set
Computational Geometry | 1992-09-27 | Paper |
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
Computational Geometry | 1992-09-27 | Paper |
Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips
Algorithmica | 1992-08-13 | Paper |
Randomized incremental construction of Delaunay and Voronoi diagrams
Algorithmica | 1992-06-28 | Paper |
Arrangements of curves in the plane --- topology, combinatorics, and algorithms
Theoretical Computer Science | 1992-06-28 | Paper |
Efficient Motion Planning for an <i>L</i>-Shaped Object
SIAM Journal on Computing | 1992-06-28 | Paper |
On disjoint concave chains in arrangements of (pseudo) lines
Information Processing Letters | 1992-06-28 | Paper |
Repeated angles in the plane and related problems
Journal of Combinatorial Theory. Series A | 1992-06-28 | Paper |
A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics | 1992-06-28 | Paper |
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science | 1992-06-26 | Paper |
On \(k\)-sets in arrangements of curves and surfaces
Discrete & Computational Geometry | 1992-06-26 | Paper |
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
SIAM Journal on Computing | 1992-06-25 | Paper |
Tight bounds on a problem of lines and intersections
Discrete Mathematics | 1992-06-25 | Paper |
Points and triangles in the plane and halving planes in space
Discrete & Computational Geometry | 1992-06-25 | Paper |
Merging visibility maps
Computational Geometry | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4213491 (Why is no real title available?) | 1991-01-01 | Paper |
On the two-dimensional Davenport-Schinzel problem
Journal of Symbolic Computation | 1990-01-01 | Paper |
An algorithm for generalized point location and its applications
Journal of Symbolic Computation | 1990-01-01 | Paper |
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
SIAM Journal on Computing | 1990-01-01 | Paper |
Triangles in space or building (and analyzing) castles in the air
Combinatorica | 1990-01-01 | Paper |
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
Discrete & Computational Geometry | 1990-01-01 | Paper |
The complexity of many cells in arrangements of planes and related problems
Discrete & Computational Geometry | 1990-01-01 | Paper |
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry | 1990-01-01 | Paper |
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry | 1990-01-01 | Paper |
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
Discrete & Computational Geometry | 1990-01-01 | Paper |
Storing line segments in partition trees
BIT | 1990-01-01 | Paper |
A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder
Information Processing Letters | 1989-01-01 | Paper |
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
On arrangements of Jordan arcs with three intersections per pair
Discrete & Computational Geometry | 1989-01-01 | Paper |
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
Discrete & Computational Geometry | 1989-01-01 | Paper |
On the general motion-planning problem with two degrees of freedom
Discrete & Computational Geometry | 1989-01-01 | Paper |
Computing the geodesic center of a simple polygon
Discrete & Computational Geometry | 1989-01-01 | Paper |
Implicitly representing arrangements of lines or segments
Discrete & Computational Geometry | 1989-01-01 | Paper |
The upper envelope of piecewise linear functions: Algorithms and applications
Discrete & Computational Geometry | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4151829 (Why is no real title available?) | 1989-01-01 | Paper |
A survey of motion planning and related geometric algorithms
Artificial Intelligence | 1988-01-01 | Paper |
The shortest watchtower and related problems for polyhedral terrains
Information Processing Letters | 1988-01-01 | Paper |
On the shortest paths between two convex polyhedra
Journal of the ACM | 1988-01-01 | Paper |
Improved lower bounds on the length of Davenport-Schinzel sequences
Combinatorica | 1988-01-01 | Paper |
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
Discrete & Computational Geometry | 1988-01-01 | Paper |
Separating two simple polygons by a sequence of translations
Discrete & Computational Geometry | 1988-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062593 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060713 (Why is no real title available?) | 1988-01-01 | Paper |
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Algorithmica | 1987-01-01 | Paper |
On <i>k</i>-Hulls and Related Problems
SIAM Journal on Computing | 1987-01-01 | Paper |
Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
Algorithmica | 1987-01-01 | Paper |
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
Algorithmica | 1987-01-01 | Paper |
On Shortest Paths Amidst Convex Polyhedra
SIAM Journal on Computing | 1987-01-01 | Paper |
Almost linear upper bounds on the length of general Davenport-Schinzel sequences
Combinatorica | 1987-01-01 | Paper |
Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
Discrete & Computational Geometry | 1987-01-01 | Paper |
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
Discrete & Computational Geometry | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4149601 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4108220 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4016244 (Why is no real title available?) | 1987-01-01 | Paper |
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
Journal of Algorithms | 1987-01-01 | Paper |
On Shortest Paths in Polyhedral Spaces
SIAM Journal on Computing | 1986-01-01 | Paper |
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
Combinatorica | 1986-01-01 | Paper |
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry | 1986-01-01 | Paper |
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
Communications on Pure and Applied Mathematics | 1986-01-01 | Paper |
Probabilistic propositional temporal logics
Information and Control | 1986-01-01 | Paper |
Intersection and Closest-Pair Problems for a Set of Planar Discs
SIAM Journal on Computing | 1985-01-01 | Paper |
Concurrent Probabilistic Programs, Or: How to Schedule If You Must
SIAM Journal on Computing | 1985-01-01 | Paper |
Verification of Probabilistic Programs
SIAM Journal on Computing | 1984-01-01 | Paper |
On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
Communications on Pure and Applied Mathematics | 1984-01-01 | Paper |
On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems
Communications on Pure and Applied Mathematics | 1984-01-01 | Paper |
On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds
Advances in Applied Mathematics | 1983-01-01 | Paper |
On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
Communications on Pure and Applied Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3829244 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3951430 (Why is no real title available?) | 1983-01-01 | Paper |
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems | 1983-01-01 | Paper |
Experience with the SETL Optimizer
ACM Transactions on Programming Languages and Systems | 1983-01-01 | Paper |
Some modified algorithms for Dijkstra's longest upsequence problem
Acta Informatica | 1982-01-01 | Paper |
Fast composition of sparse maps
Information Processing Letters | 1982-01-01 | Paper |
Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
ACM Transactions on Programming Languages and Systems | 1982-01-01 | Paper |
Transformational Derivation of a Garbage Collection Algorithm
ACM Transactions on Programming Languages and Systems | 1982-01-01 | Paper |
A strong-connectivity algorithm and its applications in data flow analysis
Computers & Mathematics with Applications | 1981-01-01 | Paper |
A strange sorting method inspired by formal differentiation
Computers & Mathematics with Applications | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3735124 (Why is no real title available?) | 1981-01-01 | Paper |
An Automatic Technique for Selection of Data Representations in SETL Programs
ACM Transactions on Programming Languages and Systems | 1981-01-01 | Paper |
Formal integration: A program transformation technique
Computer Languages | 1981-01-01 | Paper |
Structural analysis: A new approach to flow analysis in optimizing compilers
Computer Languages | 1980-01-01 | Paper |
A new proof of the Maurey-Pisier theorem
Israel Journal of Mathematics | 1979-01-01 | Paper |
Shrinking Minimal Systems and Complementation oflpnSpaces in Reflexive Banach Spaces
Proceedings of the London Mathematical Society | 1979-01-01 | Paper |
A non-nice extreme operator
Israel Journal of Mathematics | 1977-01-01 | Paper |
A counterexample on extreme operators
Israel Journal of Mathematics | 1976-01-01 | Paper |
A Note on Extreme Elements in A 0 (K, E)
Proceedings of the American Mathematical Society | 1974-01-01 | Paper |
Extremal structure in operator spaces
Transactions of the American Mathematical Society | 1974-01-01 | Paper |
Characterization and properties of extreme operators into C(Y)
Israel Journal of Mathematics | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3361227 (Why is no real title available?) | 1971-01-01 | Paper |
