Download:
|
by Eugene Fink, Derick Wood
In Proceedings of the Vision Geometry IV Conference
http://www.cs.cmu.edu/~eugene/research/papers/../full/threedim-strong.ps
Add To MetaCart
Abstract:
We define the notions of strong convexity and strong visibility. These notions generalize standard convexity and visibility, as well as several types of nontraditional convexity, such as iso-oriented rectangles and C-oriented polygons. We explore the properties of strong convexity and strong visibility in two and three dimensions. In particular, we establish analogs of the following properties of standard convex sets: • Every two points of a convex set are visible to each other. • The intersection of convex sets is a convex set. • For every point in the boundary of a convex set, there exists a supporting plane through this point. • A closed convex set in three dimensions is the intersection of all halfspaces that contain it.
Citations
|
421
|
Computational Geometry
– Preparata, Shamos
- 1985
|
|
36
|
Convex Sets
– Valentine
- 1964
|
|
25
|
Explorations in Restricted-Orientation Geometry
– Rawlins
- 1987
|
|
24
|
A fast algorithm for testing for safety and detecting deadlock in locked transaction systems
– Lipski, Papadimitriou
- 1981
|
|
21
|
On the definition and computation of rectilinear convex hulls. Information Sciences
– Ottmann, Soisalon-Soininen, et al.
- 1984
|
|
21
|
Restricted-orientation convex sets
– Rawlins, Wood
- 1991
|
|
21
|
On Generalized Visibility
– Schuierer
- 1991
|
|
18
|
Fundamentals of restricted-orientation convexity
– Fink, Wood
- 1996
|
|
18
|
Ortho-convexity and its generalizations
– Rawlins, Wood
- 1988
|
|
17
|
Hartmut Guting. Stabbing C-oriented polygons
– Ralf
- 1983
|
|
17
|
Constructing the X-Y convex hull of a set of X-Y polygons
– Nicholl, Lee, et al.
- 1983
|
|
17
|
Optimal computation of finitely oriented convex hulls
– Rawlins, Wood
- 1987
|
|
16
|
Finding the x-y convex hull of a set of x-y polygons
– Montuno, Fournier
- 1982
|
|
15
|
On Ln-sets, the Hausdorff metric, and connectedness
– Bruckner, Bruckner
- 1962
|
|
15
|
A characterisation of convex sets
– Klee
- 1949
|
|
14
|
Optimal algorithms to compute the closure of a set of iso-rectangles
– Soisalon-Soininen, Wood
- 1984
|
|
10
|
Hartmut Guting. Conquering Contours: Efficient Algorithms for Computational Geometry
– Ralf
- 1983
|
|
9
|
Hartmut Guting. Dynamic C-oriented polygonal intersection searching
– Ralf
- 1984
|
|
7
|
A decomposition theorem for convexity spaces
– Rawlins, Wood
- 1989
|
|
7
|
Distance Problems in Computational Geometry for Fixed Orientations
– Widmayer, Wu, et al.
- 1985
|
|
5
|
Local convexity and Ln-sets
– Valentine
- 1965
|
