-families of sets in general position.
A Combinatorial Property of Points and Ellipsoids.
A Combinatorial Result About Points and Balls in Euclidean Space.
A generalization of branch weight centroids
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
A geometrical method in combinatorial complexity
A lower bound for the number of comparisons is obtained, required by a computational problem of classification of an arbitrarily chosen point of the Euclidean space with respect to a given finite family of polyhedral (non-convex, in general) sets, covering the space. This lower bound depends, roughly speaking, on the minimum number of convex parts, into which one can decompose these polyhedral sets. The lower bound is then applied to the knapsack problem.
A "hidden" characterization of approximatively polyhedral convex sets in Banach spaces
A closed convex subset C of a Banach space X is called approximatively polyhedral if for each ε > 0 there is a polyhedral (= intersection of finitely many closed half-spaces) convex set P ⊂ X at Hausdorff distance < ε from C. We characterize approximatively polyhedral convex sets in Banach spaces and apply the characterization to show that a connected component of the space of closed convex subsets of X endowed with the Hausdorff metric is separable if and only if contains a polyhedral convex...
A New Duality Result Concerning Voronoi Diagrams.
A Note on the Circle Containment Problem.
A note on the realizaiton of distances within sets in euclidean space.
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
A Postscript on Distances in Convex n-Gons.
A Power Law for the Distortion of Planar Sets.
A separation theorem for finite families
A short proof, based on mixed volumes, of Liggett's theorem on the convolution of ultra-logconcave sequences.
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
An analogue of the Krein-Milman theorem for star-shaped sets.
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
Arrangements of Lines with a Minimum Number of Triangles Are Simple.