A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-57155-8_258 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1563089099 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3833669 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3957945 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding extreme points in three dimensions and solving the post-office problem in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3219752 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3700833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4162137 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3694703 / rank | |||
Normal rank | |||
Latest revision as of 07:47, 31 July 2024
scientific article; zbMATH DE number 7643395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete and efficient algorithm for the intersection of a general and a convex polyhedron |
scientific article; zbMATH DE number 7643395 |
Statements
A complete and efficient algorithm for the intersection of a general and a convex polyhedron (English)
0 references
18 January 2023
0 references
0 references
0 references
