English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Space Sweep Solves Intersection of Convex Polyhedra

Hertel, S., Mäntylä, M., Mehlhorn, K., & Nievergelt, J. (1984). Space Sweep Solves Intersection of Convex Polyhedra. Acta Informatica, 21, 501-519.

Item is

Files

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

Locators

show

Creators

show
hide
 Creators:
Hertel, Stefan1, Author
Mäntylä, Martti1, Author
Mehlhorn, Kurt2, Author           
Nievergelt, Jurg1, Author
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Summary  Plane-sweep algorithms form a fairly general approach to two-dimensional problems of computational geometry. No corresponding general space-sweep algorithms for geometric problems in 3- space are known. We derive concepts for such space-sweep algorithms that yield an efficient solution to the problem of solving any set operation (union, intersection, ...) of two convex polyhedra. Our solution matches the best known time bound of O(n log n), where n is the combined number of vertices of the two polyhedra.

Details

show
hide
Language(s): eng - English
 Dates: 2006-11-091984
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344605
Other: Local-ID: C1256428004B93B8-7BF2C9A2AD39015EC12571B200303B0E-mehlhorn84oz
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Acta Informatica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 21 Sequence Number: - Start / End Page: 501 - 519 Identifier: ISBN: 0001-5903 (Print) 1432-0525 (Online)