MPI-INF D1 Publications: Report

Technical, Research Report
@TechReport
Technischer-, Forschungsbericht

Show entries of:

this year (2023) | last year (2022) | two years ago (2021) | Notes URL

Action:

Options:

Goto entry point

Author, Editor

Author(s):

Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette

dblp
dblp
dblp

Editor(s):

BibTeX Citekey*:	mehlhorn93j
Language:	English

Title, Institution

Title*:	A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
Institution*:	INRIA
Publishers or Institutions Address*:	Le Chesnay Cedex
Type:

No, Year, pp.,

Number*:	2023	Pages*:	14
Month:		VG Wort Pages*:
Year*:	1993	ISBN/ISSN:	0249-6399

DOI:

Note, Abstract, ©

Note:
(LaTeX) Abstract:	Un polyedre est tout ensemble qui peut etre obtenu a partir de demi-espaces par un nombre fini d{'}operations de complement et d{'}intersection. Nous proposons ici un algorithme complet et efficace pour construire l{'}intersection de deux polyedres dans l{'}espace tridimensionnel dont l{'}un est convexe. L{'}algoritme est efficace car son temps de calcul est, a un facteur logarithmique pres, borne par la taille des entrees plus la taille de la sortie. L{'}algorithme est complet dans le sens qu{'}il peut traiter toutes les entrees sans aucune hypothese de position generale. De plus, nous decrivons une nouvelle structure de donnees susceptible de representer tout polyedre dans l{'}espace (toutes les structures utilisees precedemment representent seulement des ensembles de polyedres qui ne sont pas stables pour les operations booleennes de base). A polyhedron is any set that can be obtained from the open halfspaces 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 revious data structures is not closed under the basic boolean operations).
Categories / Keywords:
Copyright Message:
HyperLinks / References / URLs:
Personal Comments:
File Upload:
Download Access Level:	Public

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Algorithms and Complexity Group
Audience:	Expert
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@TECHREPORT{mehlhorn93j,
AUTHOR = {Dobrindt, Katrin and Mehlhorn, Kurt and Yvinec, Mariette},
TITLE = {A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron},
YEAR = {1993},
INSTITUTION = {INRIA},
NUMBER = {2023},
PAGES = {14},
ADDRESS = {Le Chesnay Cedex},
ISBN = {0249-6399},
}

Entry last modified by Christine Kiesel, 09/20/2006

Edit History (please click the blue arrow to see the details)

	Editor(s) Christine Kiesel	Created 07/26/2006 10:35:24
Revisions 2. 1. 0.	Editor(s) Christine Kiesel Christine Kiesel Christine Kiesel	Edit Dates 20.09.2006 14:52:00 08.08.2006 11:05:13 26.07.2006 10:41:21

Attachment Section