Show simple item record

dc.contributor.authorDixon, A. R.en_US
dc.contributor.authorKirby, G. H.en_US
dc.contributor.authorWills, D. P. M.en_US
dc.date.accessioned2014-10-21T07:29:15Z
dc.date.available2014-10-21T07:29:15Z
dc.date.issued1994en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/1467-8659.1310037en_US
dc.description.abstractThis paper addresses the problems of maintaining the consistency of spatial data under recursive subdivision algorithms for artificial terrain generation. Fractal modelling techniques are outlined, with particular reference to those based on fractional Brownian motion, and included is a brief history of recursive subdivision techniques. Existing polyhedral data structures are reviewed and shown to be inadequate for maintenance of consistency as polygons are subdivided. A new edge-based data structure is presented which provides for the efficient use and consistent storage of spatial data under these conditions. The data structure is applicable to polygons of any order and allows neighbouring polygons of different order to be stored and subdivided. Artificial terrain is demonstrated from subdivision of the hexagon, of the quadrilateral and of a combination of hexagons, quadrilaterals and triangles.en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleA Data Structure for Artificial Terrain Generationen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume13en_US
dc.description.number1en_US
dc.identifier.doi10.1111/1467-8659.1310037en_US
dc.identifier.pages37-48en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record