On the union of κ-curved objects

Alon Efrat, Matthew J. Katz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherACM
Pages206-213
Number of pages8
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA
Duration: Jun 7 1998Jun 10 1998

Other

OtherProceedings of the 1998 14th Annual Symposium on Computational Geometry
CityMinneapolis, MN, USA
Period6/7/986/10/98

Fingerprint

Oils and fats
Union
Fats
Fat Objects
Combinatorial Complexity
Radius
Object

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

Efrat, A., & Katz, M. J. (1998). On the union of κ-curved objects. In Proceedings of the Annual Symposium on Computational Geometry (pp. 206-213). ACM.

On the union of κ-curved objects. / Efrat, Alon; Katz, Matthew J.

Proceedings of the Annual Symposium on Computational Geometry. ACM, 1998. p. 206-213.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Efrat, A & Katz, MJ 1998, On the union of κ-curved objects. in Proceedings of the Annual Symposium on Computational Geometry. ACM, pp. 206-213, Proceedings of the 1998 14th Annual Symposium on Computational Geometry, Minneapolis, MN, USA, 6/7/98.
Efrat A, Katz MJ. On the union of κ-curved objects. In Proceedings of the Annual Symposium on Computational Geometry. ACM. 1998. p. 206-213
Efrat, Alon ; Katz, Matthew J. / On the union of κ-curved objects. Proceedings of the Annual Symposium on Computational Geometry. ACM, 1998. pp. 206-213
@inproceedings{13346d4e147b40d391371cc3d5a7a185,
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",
language = "English (US)",
pages = "206--213",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
publisher = "ACM",

}

TY - GEN

T1 - On the union of κ-curved objects

AU - Efrat, Alon

AU - Katz, Matthew J.

PY - 1998

Y1 - 1998

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

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

M3 - Conference contribution

SP - 206

EP - 213

BT - Proceedings of the Annual Symposium on Computational Geometry

PB - ACM

ER -