An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles (Q1943607): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2012.11.002 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077811577 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2012.11.002 / rank | |||
Normal rank | |||
Latest revision as of 06:49, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles |
scientific article |
Statements
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles (English)
0 references
20 March 2013
0 references
computational geometry
0 references
circuit
0 references
contour
0 references
rectilinear polygons
0 references
optimal algorithm
0 references
sweep plane
0 references
