An efficient algorithm for decomposing a planar polygon into star-convex components and for identifying the kernel of each component /
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
1987.
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
87-019. |
| Subjects: |
Remote Storage
| Call Number: |
QA76 .C656 87-019 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA76 .C656 87-019 | Available | |
Cushing: Texas A&M (Does not check out)
| Call Number: |
QA76 .C656 87-019 |
|
|---|---|---|
| Call Number | Status | Get It |
| QA76 .C656 87-019 | Available | |