INTERSECTION AND CLOSEST-PAIR PROBLEMS FOR A SET OF PLANAR DISCS.

Micha Sharir

doi:10.1137/0214034

INTERSECTION AND CLOSEST-PAIR PROBLEMS FOR A SET OF PLANAR DISCS.

Micha Sharir^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

73 Scopus citations

Abstract

Efficient algorithms for detecting intersections and computing closest neighbors in a set of circular discs are presented and analyzed. They adapt known techniques for solving these problems for sets of points or of line segments. The main portion of the paper contains the construction of a generalized Voronoi diagram for a set of n (possibly intersecting) circular discs in time O(n log**2n), and its applications.

Original language	English
Pages (from-to)	448-468
Number of pages	21
Journal	SIAM Journal on Computing
Volume	14
Issue number	2
DOIs	https://doi.org/10.1137/0214034
State	Published - 1985

Access to Document

10.1137/0214034

Cite this

@article{9467434483b3423ea991786612f28cb9,

title = "INTERSECTION AND CLOSEST-PAIR PROBLEMS FOR A SET OF PLANAR DISCS.",

abstract = "Efficient algorithms for detecting intersections and computing closest neighbors in a set of circular discs are presented and analyzed. They adapt known techniques for solving these problems for sets of points or of line segments. The main portion of the paper contains the construction of a generalized Voronoi diagram for a set of n (possibly intersecting) circular discs in time O(n log**2n), and its applications.",

author = "Micha Sharir",

year = "1985",

doi = "10.1137/0214034",

language = "אנגלית",

volume = "14",

pages = "448--468",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "2",

}

TY - JOUR

T1 - INTERSECTION AND CLOSEST-PAIR PROBLEMS FOR A SET OF PLANAR DISCS.

AU - Sharir, Micha

PY - 1985

Y1 - 1985

N2 - Efficient algorithms for detecting intersections and computing closest neighbors in a set of circular discs are presented and analyzed. They adapt known techniques for solving these problems for sets of points or of line segments. The main portion of the paper contains the construction of a generalized Voronoi diagram for a set of n (possibly intersecting) circular discs in time O(n log**2n), and its applications.

AB - Efficient algorithms for detecting intersections and computing closest neighbors in a set of circular discs are presented and analyzed. They adapt known techniques for solving these problems for sets of points or of line segments. The main portion of the paper contains the construction of a generalized Voronoi diagram for a set of n (possibly intersecting) circular discs in time O(n log**2n), and its applications.

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

U2 - 10.1137/0214034

DO - 10.1137/0214034

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0022061437

SN - 0097-5397

VL - 14

SP - 448

EP - 468

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 2

ER -

INTERSECTION AND CLOSEST-PAIR PROBLEMS FOR A SET OF PLANAR DISCS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this