A fast algorithm for an envelope construction of a huge set of topologically consistent polygons /
This paper describes an efficient algorithm for the determination of an envelope of a set of polygons. The polygons have to be aligned along their borders - the case which, for example, appears in geographic information systems. The edges, which belong to two neighbouring polygons, are called twined...
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Format: | Book Chapter |
| Jezik: | English |
| Teme: | |
| Sorodne knjige/članki: | Vsebovano v:
Engineering with computers |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Vzdrževanje sistema
Trenutno vzdržujemo knjižnični informacijski sistem.
Informacije o zalogi so trenutno nedostopne. Opravičujemo se za nevšečnosti in vas prosimo da nas ponovno kontaktirate: