English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Sweeping and Maintaining Two-dimensional Arrangements on Surfaces

Berberich, E., Fogel, E., Halperin, D., & Wein, R. (2007). Sweeping and Maintaining Two-dimensional Arrangements on Surfaces. In O. Aichholzer, & T. Hackl (Eds.), Collection of Abstracts of the 23rd European Workshop on Computational Geometry (pp. 223-226). Graz, Austria: Technische Universität Graz.

Item is

 

show all hide all

Basic

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

Files

show Files
hide Files
:
arr_surf_EWCG07.ps (Any fulltext), 5KB
 
File Permalink:
-
Name:
arr_surf_EWCG07.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Berberich, Eric1, Author           
Fogel, Efi2, Author
Halperin, Dan2, Author
Wein, Ron1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. A major goal of our work is to maximize code reuse in implementing algorithms that employ the prevalent sweep-line paradigm, and consequently to minimize the effort needed to extend the implementation of the paradigm to various surfaces and families of curves embedded on them. We show how the sweep-line paradigm is used to construct an arrangement of curves embedded on an orientable parametric surface, and explain how the arrangement package of {\sc cgal}, which previously handled only arrangements of bounded planar curves, is extended to handle curves embedded on a general surface. To the best of our knowledge, this is the first software implementation of generic algorithms that can handle arrangements on general parametric surfaces.

Details

show
hide
Language(s): eng - English
 Dates: 2008-03-262007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356740
Other: Local-ID: C12573CC004A8E26-5FB99C71838C942BC1257296003EC59D-BFHW-SMTDAS2007
 Degree: -

Event

show
hide
Title: 23rd European Workshop on Computational Geometry
Place of Event: Graz, Austria
Start-/End Date: 2007-03-19 - 2007-03-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: Collection of Abstracts of the 23rd European Workshop on Computational Geometry
Source Genre: Proceedings
 Creator(s):
Aichholzer, Oswin1, Editor
Hackl, Thomas1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Graz, Austria : Technische Universität Graz
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 223 - 226 Identifier: ISBN: 978-3-902465-62-7