EuDML | Browse

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

Previous Page 4 Next

Displaying 61 – 80 of 92

On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.

Micha Sharir, D. Leven (1987)

Discrete & computational geometry

On the Number of Guard Edges of a Polygon.

Jung-Heum Park, Sung Yong Shin, Kyung-Yong Chwa, T.C. Woo (1993)

Discrete & computational geometry

Parallelepipeds circumscribed about a convex body in 3-space.

Makeev, V.V. (2005)

Journal of Mathematical Sciences (New York)

Partitioning Arrangements of Lines, II: Applications.

P.K. Agarwal (1990)

Discrete & computational geometry

Polygons with hidden vertices.

Ewald, Günter (2001)

Beiträge zur Algebra und Geometrie

Presssigning the Shape for Bodies of Constant Width.

Egon Schulte, Sinisa Vrecica (1983)

Monatshefte für Mathematik

Proof of Grünbaum's Conjecture on Common Transversals for Translates.

H. Tverberg (1989)

Discrete & computational geometry

Regular polygons

Stanislav Šmakal (1978)

Czechoslovak Mathematical Journal

Repeated Angles in E4 .

G. Purdy (1988)

Discrete & computational geometry

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

Tessellations Generated by Hyperplanes.

R. Schneider (1987)

Discrete & computational geometry

The Complexity of Cutting Complexes.

B. Chazelle, Herbert Edelsbrunner, Guibas Leonidas J. (1989)

Discrete & computational geometry

The Furthest-Site Geodesic Voronoi Diagram.

B. Aronov, S. Fortune, G. Wilfong (1993)

Discrete & computational geometry

Currently displaying 61 – 80 of 92

Previous Page 4 Next