Computing a face in an arrangement of line segments

Bernard Chazelle; Herbert Edelsbrunner; Leonidas Guibas; Micha Sharir; Jack Snoeyink

Computing a face in an arrangement of line segments

Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, Jack Snoeyink

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O(n α(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique [3].

Original language	English
Title of host publication	Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Publisher	Association for Computing Machinery
Pages	441-448
Number of pages	8
ISBN (Print)	0897913760
State	Published - 1 Mar 1991
Event	2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States Duration: 28 Jan 1991 → 30 Jan 1991

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
Country/Territory	United States
City	San Francisco
Period	28/01/91 → 30/01/91

Cite this

@inproceedings{cb9d9036a6a248b4bc5ba33033fa203d,

title = "Computing a face in an arrangement of line segments",

abstract = "We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O(n α(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique [3].",

author = "Bernard Chazelle and Herbert Edelsbrunner and Leonidas Guibas and Micha Sharir and Jack Snoeyink",

note = "Publisher Copyright: {\textcopyright} 1991 Association for Computing Machinery. All rights reserved.; 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 ; Conference date: 28-01-1991 Through 30-01-1991",

year = "1991",

month = mar,

day = "1",

language = "אנגלית",

isbn = "0897913760",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "441--448",

booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",

}

Chazelle, B, Edelsbrunner, H, Guibas, L, Sharir, M & Snoeyink, J 1991, Computing a face in an arrangement of line segments. in Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 441-448, 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991, San Francisco, United States, 28/01/91.

Computing a face in an arrangement of line segments. / Chazelle, Bernard; Edelsbrunner, Herbert; Guibas, Leonidas et al.
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, 1991. p. 441-448 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computing a face in an arrangement of line segments

AU - Chazelle, Bernard

AU - Edelsbrunner, Herbert

AU - Guibas, Leonidas

AU - Sharir, Micha

AU - Snoeyink, Jack

PY - 1991/3/1

Y1 - 1991/3/1

N2 - We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O(n α(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique [3].

AB - We present a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane that is fairly simple to implement. The expected running time of the algorithm is O(n α(n) log n). The analysis of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor analysis technique [3].

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84914756148

SN - 0897913760

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 441

EP - 448

BT - Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991

PB - Association for Computing Machinery

T2 - 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991

Y2 - 28 January 1991 through 30 January 1991

ER -

Computing a face in an arrangement of line segments

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this