There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 453 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 439 | - |
dc.citation.title | DISCRETE & COMPUTATIONAL GEOMETRY | - |
dc.citation.volume | 34 | - |
dc.contributor.author | Alt, H | - |
dc.contributor.author | Cheong, O | - |
dc.contributor.author | Vigneron, A | - |
dc.date.accessioned | 2023-12-22T10:12:55Z | - |
dc.date.available | 2023-12-22T10:12:55Z | - |
dc.date.created | 2016-06-10 | - |
dc.date.issued | 2005-09 | - |
dc.description.abstract | Voronoi diagrams of curved objects can show certain phenomena that are often considered artifacts: The Voronoi diagram is not connected; there are pairs of objects whose bisector is a closed curve or even a two-dimensional object; there are Voronoi edges between different parts of the same site (so-called self-Voronoi-edges); these self-Voronoi-edges may end at seemingly arbitrary points not on a site, and, in the case of a circular site, even degenerate to a single isolated point. We give a systematic study of these phenomena, characterizing their differential-geometric and topological properties. We show how a given set of curves can be refined such that the resulting curves define a "well-behaved" Voronoi diagram. We also give a randomized incremental algorithm to compute this diagram. The expected running time of this algorithm is O(n log n) | - |
dc.identifier.bibliographicCitation | DISCRETE & COMPUTATIONAL GEOMETRY, v.34, no.3, pp.439 - 453 | - |
dc.identifier.doi | 10.1007/s00454-005-1192-0 | - |
dc.identifier.issn | 0179-5376 | - |
dc.identifier.scopusid | 2-s2.0-23944492932 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19655 | - |
dc.identifier.url | http://link.springer.com/article/10.1007%2Fs00454-005-1192-0 | - |
dc.identifier.wosid | 000231312500005 | - |
dc.language | 영어 | - |
dc.publisher | SPRINGER | - |
dc.title | The Voronoi diagram of curved objects | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | MEDIAL AXIS ALGORITHM | - |
dc.subject.keywordPlus | PLANAR DOMAINS | - |
dc.subject.keywordPlus | COMPUTATIONAL GEOMETRY | - |
dc.subject.keywordPlus | BOUNDARIES | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.