English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  A complete and efficient algorithm for the intersection of a general convex polyhedron

Dobrindt, K., Mehlhorn, K., & Yvinec, M.(1993). A complete and efficient algorithm for the intersection of a general convex polyhedron (MPI-I-93-140). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-B755-E Version Permalink: https://hdl.handle.net/21.11116/0000-0001-AF19-F
Genre: Report

Files

show Files
hide Files
:
MPI-I-93-140.pdf (Any fulltext), 14MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0019-0A10-0
Name:
MPI-I-93-140.pdf
Description:
-
OA-Status:
Not specified
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Dobrindt, K.1, Author
Mehlhorn, Kurt1, Author           
Yvinec, M.1, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: A polyhedron is any set that can be obtained from the open half\-spaces by a finite number of set complement and set intersection operations. We give an efficient and complete algorithm for intersecting two three--dimensional polyhedra, one of which is convex. The algorithm is efficient in the sense that its running time is bounded by the size of the inputs plus the size of the output times a logarithmic factor. The algorithm is complete in the sense that it can handle all inputs and requires no general position assumption. We also describe a novel data structure that can represent all three--dimensional polyhedra (the set of polyhedra representable by all previous data structures is not closed under the basic boolean operations).

Details

show
hide
Language(s): eng - English
 Dates: 1993
 Publication Status: Issued
 Pages: 14 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-93-140
BibTex Citekey: MPI-I-93-140
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -