TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS (Q4931734): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterated snap rounding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest path geometric rounding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-rounding a three-dimensional polyhedral subdivision / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A floating-point technique for extending the available precision / rank | |||
Normal rank |
Revision as of 06:22, 3 July 2024
scientific article; zbMATH DE number 5793869
Language | Label | Description | Also known as |
---|---|---|---|
English | TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS |
scientific article; zbMATH DE number 5793869 |
Statements
TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS (English)
0 references
30 September 2010
0 references
Minkowski sum
0 references
kinetic framework
0 references
robust computational geometry
0 references
0 references