On the union of κ-curved objects

Alon Efrat; Matthew J. Katz

doi:10.1145/276884.276908

On the union of κ-curved objects

Alon Efrat, Matthew J. Katz

Research output: Contribution to conference › Paper › peer-review

11 Scopus citations

Abstract

A (not necessarily convex) object C in the plane is κ-curved for some constant κ, κ<1, if it has constant description complexity, and for each point p on the boundary of C, one can place a disk B whose boundary passes through p, its radius is κ·diam(C) and it is contained in C. We prove that the combinatorial complexity of the boundary of the union of a set C of n κ-curved objects (e.g., fat ellipses or rounded heart-shaped objects) is O(λ_s(n)log n), for some constant s.

Original language	English
Pages	206-213
Number of pages	8
DOIs	https://doi.org/10.1145/276884.276908
State	Published - 1 Jan 1998
Externally published	Yes
Event	Proceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA Duration: 7 Jun 1998 → 10 Jun 1998

Conference

Conference	Proceedings of the 1998 14th Annual Symposium on Computational Geometry
City	Minneapolis, MN, USA
Period	7/06/98 → 10/06/98

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Access to Document

10.1145/276884.276908

Cite this

@conference{726e534102ad4875921277350107deea,

title = "On the union of κ-curved objects",

abstract = "A (not necessarily convex) object C in the plane is κ-curved for some constant κ, κ<1, if it has constant description complexity, and for each point p on the boundary of C, one can place a disk B whose boundary passes through p, its radius is κ·diam(C) and it is contained in C. We prove that the combinatorial complexity of the boundary of the union of a set C of n κ-curved objects (e.g., fat ellipses or rounded heart-shaped objects) is O(λs(n)log n), for some constant s.",

author = "Alon Efrat and Katz, {Matthew J.}",

year = "1998",

month = jan,

day = "1",

doi = "10.1145/276884.276908",

language = "English",

pages = "206--213",

note = "Proceedings of the 1998 14th Annual Symposium on Computational Geometry ; Conference date: 07-06-1998 Through 10-06-1998",

}

TY - CONF

T1 - On the union of κ-curved objects

AU - Efrat, Alon

AU - Katz, Matthew J.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - A (not necessarily convex) object C in the plane is κ-curved for some constant κ, κ<1, if it has constant description complexity, and for each point p on the boundary of C, one can place a disk B whose boundary passes through p, its radius is κ·diam(C) and it is contained in C. We prove that the combinatorial complexity of the boundary of the union of a set C of n κ-curved objects (e.g., fat ellipses or rounded heart-shaped objects) is O(λs(n)log n), for some constant s.

AB - A (not necessarily convex) object C in the plane is κ-curved for some constant κ, κ<1, if it has constant description complexity, and for each point p on the boundary of C, one can place a disk B whose boundary passes through p, its radius is κ·diam(C) and it is contained in C. We prove that the combinatorial complexity of the boundary of the union of a set C of n κ-curved objects (e.g., fat ellipses or rounded heart-shaped objects) is O(λs(n)log n), for some constant s.

UR - http://www.scopus.com/inward/record.url?scp=0031643499&partnerID=8YFLogxK

U2 - 10.1145/276884.276908

DO - 10.1145/276884.276908

M3 - Paper

AN - SCOPUS:0031643499

SP - 206

EP - 213

T2 - Proceedings of the 1998 14th Annual Symposium on Computational Geometry

Y2 - 7 June 1998 through 10 June 1998

ER -

On the union of κ-curved objects

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this