English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Snap Rounding of Bézier Curves

Eigenwillig, A., Kettner, L., & Wolpert, N. (2007). Snap Rounding of Bézier Curves. In Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07) (pp. 158-167). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-20B6-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-C230-C
Genre: Conference Paper

Files

show Files
hide Files
:
EKW-BSnap-SCG07-addendum.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
EKW-BSnap-SCG07-addendum.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
© ACM, 2007. This is the authors' version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in the Proceedings of the 23rd Annual Symposium on Computational Geometry (SCG 2007).
License:
-
:
EKW-BSnap-SCG07-authprep.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
EKW-BSnap-SCG07-authprep.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
© ACM, 2007. This is the authors' version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in the Proceedings of the 23rd Annual Symposium on Computational Geometry (SCG 2007).
License:
-

Locators

show

Creators

show
hide
 Creators:
Eigenwillig, Arno1, Author           
Kettner, Lutz1, Author           
Wolpert, Nicola1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present an extension of snap roundingfrom straight-line segments (see Guibas and Marimont, 1998)to Bézier curves of arbitrary degree, and thus the first method for geometric roundingof curvilinear arrangements.Our algorithm takes a set of intersecting Bézier curvesand directly computes a geometric rounding of their true arrangement, without the need of representing the true arrangement exactly.The algorithm's output is a deformation of the true arrangementthat has all Bézier control points at integer pointsand comes with the same geometric guarantees as instraight-line snap rounding: during rounding, objects do not movefurther than the radius of a pixel, and features of thearrangement may collapse but do not invert.

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-052007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356731
DOI: 10.1145/1247069.1247101
Other: Local-ID: C12573CC004A8E26-100BAFC894F6C41FC125728F004F8913-Eigenwillig2007b
 Degree: -

Event

show
hide
Title: Twenty-Third Annual Symposium on Computational Geometry
Place of Event: Gyeongju, South Korea
Start-/End Date: 2007-06-06 - 2007-06-08

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07)
  Abbreviation : SCG 2007
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 158 - 167 Identifier: ISBN: 978-1-59593-705-6