Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/8324
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Raman, Sundaresan | - |
dc.date.accessioned | 2023-01-05T11:01:24Z | - |
dc.date.available | 2023-01-05T11:01:24Z | - |
dc.date.issued | 2008-09 | - |
dc.identifier.uri | https://onlinelibrary.wiley.com/doi/full/10.1111/j.1467-8659.2008.01209.x | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8324 | - |
dc.description.abstract | The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, the extended lookup table differentiates scalar values equal to the isovalue from scalar values greater than the isovalue. The lookup table has 38= 6561 entries, based on three possible labels, ‘−’ or ‘=’ or ‘+’, of each cube vertex. We present an algorithm based on this lookup table which returns an isosurface close to the Marching Cubes isosurface, but without any degenerate triangles or any small areas, edges or angles. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Wiley | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Isosurface Mesh Generation | en_US |
dc.subject | Cubes Lookup Table | en_US |
dc.title | Quality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.