Detecting geometric infeasibility (Q1274558): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: LEDA / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4875176 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3772828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3217599 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spatial Planning: A Configuration Space Approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326383 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 22 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3716330 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separating two simple polygons by a sequence of translations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Assembly sequences for polyhedra / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:56, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Detecting geometric infeasibility |
scientific article |
Statements
Detecting geometric infeasibility (English)
0 references
12 January 1999
0 references
geometric reasoning
0 references
assembly planning
0 references
motion planning
0 references
complete algorithms
0 references
arrangement computation in \(D\) dimensions
0 references
0 references