Name
Abstract | ||
|---|---|---|
We present a polygon simplification method that works in multidimensional spaces or even in semi-metric spaces that need not be vector spaces. We require only that a (semi-)distance between pairs of points be defined that need not satisfy the triangle inequality. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/978-3-642-59802-9_52 | DAGM-Symposium |
Keywords | Field | DocType |
relevant frames,automatic extraction,polygon simplification | Computer vision,Vector space,Polygon,Computer graphics (images),Computer science,Artificial intelligence,Triangle inequality | Conference |
ISBN | Citations | PageRank |
3-540-67886-7 | 3 | 0.48 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Longin Jan Latecki | 1 | 3301 | 176.88 |
| Daniel Dementhon | 2 | 1327 | 139.94 |
| Azriel Rosenfeld | 3 | 10490 | 6002.75 |