Under the Euclidean metric in 3-space, the bisectors of three points intersect in at most one connected componentnamely, a line. In contrast to this, we show that, under non-smooth convex distance functions, there is no general upper bound to the number of connected components of the intersection of
β¦ LIBER β¦
On delaunay oriented matroids for convex distance functions
β Scribed by F. Santos
- Book ID
- 110649207
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 796 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On non-smooth convex distance functions
β
Ngoc-Minh LΓͺ
π
Article
π
1997
π
Elsevier Science
π
English
β 617 KB
On exchange properties for Coxeter matro
β
Alexandre V. Borovik; Israel Gelfand; Neil White
π
Article
π
1998
π
Elsevier Science
π
English
β 704 KB
On a Mutation Problem for Oriented Matro
β
JΓΌrgen Bokowski; Holger Rohlfs
π
Article
π
2001
π
Elsevier Science
π
English
β 469 KB
For uniform oriented matroids M with n elements, there is in the realizable case a sharp lower bound L r (n) for the number mut(M) of mutations of M : L r (n) = n β€ mut(M), see Shannon [17]. Finding a sharp lower bound L(n) β€ mut(M) in the non-realizable case is an open problem for rank d β₯ 4. Las V
Error Bounds for Some Convex Functions a
β
Ng, Kung Fu; Yang, Wei Hong
π
Article
π
2005
π
Society for Industrial and Applied Mathematics
π
English
β 205 KB
A parallel algorithm based on convexity
β
Phan Thanh An; Le Hong Trang
π
Article
π
2011
π
Springer US
π
English
β 310 KB
On Jessen's inequality for convex functi
β
Paul R Beesack; Josip E PeΔariΔ
π
Article
π
1985
π
Elsevier Science
π
English
β 788 KB