-families of sets in general position.
Page 1 Next
Displaying 1 – 20 of 92
A Combinatorial Property of Points and Ellipsoids.
D.G. Larman, I. Bàràny (1990)
Discrete & computational geometry
A Combinatorial Result About Points and Balls in Euclidean Space.
I. Bárány, J.H. Schmerl, S.J. Sidney, J. Urrutia (1989)
Discrete & computational geometry
A generalization of branch weight centroids
W. Piotrowski (1987)
Applicationes Mathematicae
A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
R. Wenger (1990)
Discrete & computational geometry
A geometrical method in combinatorial complexity
Jaroslav Morávek (1981)
Aplikace matematiky
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
Taras Banakh, Ivan Hetman (2012)
Studia Mathematica
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.
F. Aurenhammer (1990)
Discrete & computational geometry
A Note on the Circle Containment Problem.
R. Hayward (1989)
Discrete & computational geometry
A note on the realizaiton of distances within sets in euclidean space.
D.G. Larman (1978)
Commentarii mathematici Helvetici
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
M. Kolinek (1987)
Discrete & computational geometry
A Postscript on Distances in Convex n-Gons.
P. Erdös, P. Fishburn (1994)
Discrete & computational geometry
A Power Law for the Distortion of Planar Sets.
M.H. Freedman (1987)
Discrete & computational geometry
A separation theorem for finite families
Milan Vlach (1971)
Commentationes Mathematicae Universitatis Carolinae
A short proof, based on mixed volumes, of Liggett's theorem on the convolution of ultra-logconcave sequences.
Gurvits, Leonid (2009)
The Electronic Journal of Combinatorics [electronic only]
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
Dragan M. Acketa, Snežana Matić-Kekić (1992)
The Yugoslav Journal of Operations Research
An analogue of the Krein-Milman theorem for star-shaped sets.
Martini, Horst, Wenzel, Walter (2003)
Beiträge zur Algebra und Geometrie
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
B. Chazelle, M. Sharir, J. Matousek (1995)
Discrete & computational geometry
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
C.K. Yap (1987)
Discrete & computational geometry
Arrangements of Lines with a Minimum Number of Triangles Are Simple.
J.P. Roudneff (1988)
Discrete & computational geometry
Currently displaying 1 – 20 of 92
Page 1 Next