Name
Abstract | ||
|---|---|---|
Cartographers collect more data than they need,and so must simplify coastlines,boundaries,and other lin- ear features to display a map at a given scale. Many simplification methods,however,can introduce inter- sections that were not originally present,corrupting the features. Kulik suggests a simple shortcut operation for polyg- onal lines: remove a point pi and connect its former neighbors pi�1 and pi+1 directly,but only if the tri- anglepi�1pipi+1 is empty of other points. We show geodesic triangulations support shortcut operations and triangle tests in O log2 n time for connected subdivi- sions of size n. This can be integrated into simplification methods that support cartographic preferences so that they can also avoid self-intersection. |
Year | Venue | Field |
|---|---|---|
2005 | CCCG | Discrete mathematics,Binary logarithm,Polygon,Computer science,Subdivision,If and only if,Geodesic |
DocType | Citations | PageRank |
Conference | 1 | 0.39 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Craig Falls | 1 | 1 | 0.39 |
| Yuanxin Liu | 2 | 123 | 9.27 |
| Jack Snoeyink | 3 | 2842 | 231.68 |
| Diane L. Souvaine | 4 | 480 | 77.99 |