A lower bound on the complexity of the convex hull problem for simple polyhedra (Q1107997): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On finding the convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for finding the convex hull of a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank | |||
Normal rank | |||
Latest revision as of 18:46, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the complexity of the convex hull problem for simple polyhedra |
scientific article |
Statements
A lower bound on the complexity of the convex hull problem for simple polyhedra (English)
0 references
1987
0 references
computational geometry
0 references
convex hull
0 references
lower bound
0 references
simple polyhedron
0 references
geometric complexity
0 references
