Finding the Intersection of Two Convex Polyhedra

Muller, D.E.; Preparata, F.P.

Permalink

https://hdl.handle.net/2142/74093 Copy

Description

Title

Finding the Intersection of Two Convex Polyhedra

Author(s)

• Muller, D.E.
• Preparata, F.P.

Issue Date

1977-10

Keyword(s)

• Computational complexity
• Computational geometry
• Analysis of algorithms
• Polyhedra
• Intersection of polyhedra
• Separating plane
• Linear separability
• Geometric duality
• Convex hull

Publisher

Applied Computation Theory Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Series/Report Name or Number

Coordinated Science Laboratory Report no. UILU-ENG 77-2240, R-793, ACT-6

Type of Resource

text

Language

English

Permalink

http://hdl.handle.net/2142/74093

Sponsor(s)/Grant Number(s)

• Joint Services Electronics Program / DAAB-07-72-C-0259
• National Science Foundation / MCS76-17321

Owning Collections