EuDML | Browse

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
52-XX Convex and discrete geometry
52Axx General convexity
52A37 Other problems of combinatorial convexity

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 8 of 8

Separating Convex Sets in the Plane.

J. Urrutia, J. Czyzowicz, E. Rivera-Campo, J. Zaks (1992)

Discrete & computational geometry

Separation of $(n + 1)$ -families of sets in general position in $𝐑^{n}$

Mircea Balaj (1997)

Commentationes Mathematicae Universitatis Carolinae

In this paper the main result in [1], concerning $(n + 1)$ -families of sets in general position in $𝐑^{n}$ , is generalized. Finally we prove the following theorem: If ${A_{1}, A_{2}, \dots, A_{n + 1}}$ is a family of compact convexly connected sets in general position in $𝐑^{n}$ , then for each proper subset $I$ of ${1, 2, \dots, n + 1}$ the set of hyperplanes separating $\cup {A_{i} : i \in I}$ and $\cup {A_{j} : j \in \bar{I}}$ is homeomorphic to $S_{n}^{+}$ .

Simplified Voronoi Diagrams.

J. Canny, Bruce Donald (1988)

Discrete & computational geometry

Six lonely runners.

Bohman, Tom, Holzman, Ron, Kleitman, Dan (2001)

The Electronic Journal of Combinatorics [electronic only]

Some Extremal Results on Circles Containing Points.

Rephael Wenger, R. Hayward, David Rappaport (1989)

Discrete & computational geometry

Some Provably Hard Crossing Number Problems.

D. Bienstock (1991)

Discrete & computational geometry

Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs.

F.R.K. Chung (1989)

Discrete & computational geometry

Symmetries of woven fabrics

Bohdan Zelinka (1984)

Aplikace matematiky

Currently displaying 1 – 8 of 8

Page 1