ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (Q4818554): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Ray shooting in polygons using geodesic triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Visibility and intersection problems in plane geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for computing the visibility polygon from a point / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast triangulation of the plane with respect to simple polygons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposing a Polygon into Simpler Components / rank | |||
Normal rank | |||
Revision as of 10:56, 7 June 2024
scientific article; zbMATH DE number 2104255
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS |
scientific article; zbMATH DE number 2104255 |
Statements
ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS (English)
0 references
29 September 2004
0 references
simple polygons
0 references
dynamic programming
0 references
convex decomposition
0 references
