Filters








336 Hits in 4.2 sec

Practical considerations on Marching Cubes 33 topological correctness

Lis Custodio, Tiago Etiene, Sinesio Pesco, Claudio Silva
2013 Computers & graphics  
In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prevents the extraction of topologically correct isosurfaces for the ambiguous configuration 13.5.  ...  This work closes an existing gap in the topological correctness of Marching Cubes 33.  ...  Juliana Freire for their valuable help with the paper. The medical datasets used in this work can be download from the Volvis project webpage.  ... 
doi:10.1016/j.cag.2013.04.004 fatcat:vwrih2kljvdyvmqgatsxw52iau

Cubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data

Chien.-Chang Ho, Fu-Che Wu, Bing-Yu Chen, Yung-Yu Chuang, Ming Ouhyoung
2005 Computer graphics forum (Print)  
Our method provides a relatively simple and easy-to-implement solution to all these problems by converting 3D marching cubes into 2D cubical marching squares, resolving topology ambiguity with sharp features  ...  The original marching cubes algorithm suffers from problems of topological inconsistency, cracks in adaptive resolution and inability to preserve sharp features.  ...  Acknowledgments The authors wish to thank the reviewers for their helpful comments.  ... 
doi:10.1111/j.1467-8659.2005.00879.x fatcat:i7r2snwzunhz7i7oaqyxu3bwma

Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing

A. Lopes, K. Brodlie
2003 IEEE Transactions on Visualization and Computer Graphics  
This paper proposes a modification of the Marching Cubes algorithm for isosurfacing, with the intent of improving the representation of the surface in the interior of each grid cell.  ...  The representation is robust in the sense that the surface is visually continuous as the data and threshold change in value. Each interior point lies on the isosurface.  ...  This new version of Marching Cubes will be available as an IRIS Explorer module from the module repository at the IRIS Explorer Centre of Excellence at the University of Leeds (http://www.comp.leeds.ac.uk  ... 
doi:10.1109/tvcg.2003.1175094 fatcat:e6zeev64snaf5fnx73kp5pydly

Interactive Approaches to Contouring and Isosurfacing for Geovisualization [chapter]

Adriano Lopes, Ken Brodlie
2005 Exploring Geovisualization  
In particular, we show how they are strongly intertwined and how they have moved from being non-interactive to interactive processes, making them appropriate for the kinds of dynamic representation required  ...  This chapter describes ways in which contouring and isosurfacing techniques for 3D computer graphics have evolved.  ...  In §17.2, we describe the essential problem to be solved in generating contours or isosurfaces, and then sketch the outline of the remainder of the chapter.  ... 
doi:10.1016/b978-008044531-1/50435-8 fatcat:sb5hfa6b65ditcejhe5erthoca

A type-merging algorithm for extracting an isosurface from volumetric data

Kwang-Man Oh, Kyu Ho Park
1996 The Visual Computer  
The basic idea is to classify the configurations of the marching cubes approach into types.  ...  The execution time is somewhat longer than that of the marching cubes algorithm.  ...  We thank Jason Choi for his help in writing this paper. We also thank the anonymous reviewers for the very detailed, helpful comments and suggestions.  ... 
doi:10.1007/s003710050074 fatcat:bfzvu3qor5eivhh6sm3wbhqdmm

A type-merging algorithm for extracting an isosurface from volumetric data

Kwang-Man Oh, Kyu Ho Park
1996 The Visual Computer  
The basic idea is to classify the configurations of the marching cubes approach into types.  ...  The execution time is somewhat longer than that of the marching cubes algorithm.  ...  We thank Jason Choi for his help in writing this paper. We also thank the anonymous reviewers for the very detailed, helpful comments and suggestions.  ... 
doi:10.1007/bf01785873 fatcat:ncow4m2a4za77hudlrkmvtyq6m

Surface Models and the Resolution of N-Dimensional Cell Ambiguity [chapter]

Steve Hill, Jonathan C. Roberts
1995 Graphics Gems V  
The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper.  ...  Users should always cite the published version of record.  ...  For instance, the Marching Cubes method (Lorensen and Cline 1987), locates the surface lying between adjacentvertices of the n-cube edges in which the cell vertices represent discrete sample values.  ... 
doi:10.1016/b978-0-12-543457-7.50023-1 fatcat:oem4llujrrbslj2xhmvl6ph3ta

A parallel dual marching cubes approach to quad only surface reconstruction

Roberto Grosso, Daniel Zint
2021 The Visual Computer  
AbstractWe present a novel method that reconstructs surfaces from volume data using a dual marching cubes approach without lookup tables.  ...  Due to the transition between layers in volume data, meshes have numerous vertices with valence three.  ...  Ambiguous cases are solved with the asymptotic decider [31] .  ... 
doi:10.1007/s00371-021-02139-w fatcat:yflgfqk6abaxzau5xpwgegqszu

A survey of the marching cubes algorithm

Timothy S. Newman, Hong Yi
2006 Computers & graphics  
A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm.  ...  The paper's primary aim is to survey the development of the algorithm and its computational properties, extensions, and limitations (including the attempts to resolve its limitations).  ...  We also are grateful for the helpful suggestions of the reviewers and other colleagues, including the ideas that have arisen from discussions with J. Brad Byrd, Suk Seo, and Huijuan Zhang.  ... 
doi:10.1016/j.cag.2006.07.021 fatcat:6bzbzm5vszg4lozbqyctt3etge

Robust adaptive meshes for implicit surfaces

Afonso Paiva, Helio Lopes, Thomas Lewiner, Luiz De Figueiredo
2006 Computer Graphics and Image Processing (SIBGRAPI), Proceedings of the Brazilian Symposium on  
It guarantees the green parts of the surface, and the ambiguity of the other parts is resolved with a small number of refinements.  ...  The triangle mesh is then generated from that octree through an enhanced dual marching.  ...  Note that the tests of the asymptotic decider of Nielson and Hamann [10] are sufficient to guarantee the manifoldness of the results, but in case the subdivision of the octree is limited in space, the  ... 
doi:10.1109/sibgrapi.2006.40 dblp:conf/sibgrapi/PaivaLLF06 fatcat:nd255u3cyng5rpt2wynyn3aosu

An extended triangulation to the Marching Cubes 33 algorithm

Lis Custodio, Sinesio Pesco, Claudio Silva
2019 Journal of the Brazilian Computer Society  
In this paper, we present an extended version of the Marching Cubes 33 algorithm (a variation of the Marching Cubes algorithm which guarantees topological correctness), called Extended Marching Cubes 33  ...  The Marching Cubes algorithm is arguably the most popular isosurface extraction algorithm. Since its inception, two problems have lingered, namely, triangle quality and topology correctness.  ...  The datasets used in this work can be download from the Volvis project web page (https://labs.cs.sunysb.edu/labs/vislab/volvis/).  ... 
doi:10.1186/s13173-019-0086-6 fatcat:7oe2go2kordtpgi5rhmsn74o4e

Neural Marching Cubes [article]

Zhiqin Chen, Hao Zhang
2021 arXiv   pre-print
We introduce Neural Marching Cubes (NMC), a data-driven approach for extracting a triangle mesh from a discretized implicit field.  ...  in poor estimates of the true underlying implicit field.  ...  However, these are not sufficient to resolve all ambiguities.  ... 
arXiv:2106.11272v2 fatcat:rws3s3kxnveznglahdv6rkmxya

On marching cubes

G.M. Nielson
2003 IEEE Transactions on Visualization and Computer Graphics  
The original marching cubes algorithm is based upon linear interpolation along edges of the voxels. The asymptotic decider method is based upon bilinear interpolation on faces of the voxels.  ...  The algorithm of this paper carries this theme forward to using trilinear interpolation on the interior of voxels.  ...  INTRODUCTION T HIS paper is an extension of two earlier papers: the original marching cubes paper, [1] and a subsequent paper, [2] , that used alternative triangulations to resolve a problem of the  ... 
doi:10.1109/tvcg.2003.1207437 fatcat:4i2ihbejxjbfdjmxnkybhs7qpe

A 3D surface reconstruction algorithm from DICOM data
DICOMデータからの3次元サーフェース再構成アルゴリズム

Bo Wang, Yoshiki Arakawa, Junji Takatsubo, Jun Wada
2002 Transactions of Visualization Society of Japan  
This IMC algorithm preserves the merit and overcomes the demerit of Marching Cubes.  ...  This paper describes a method to reconstruct the isosurface from DICOM data. First, a method to read the DICOM data is explained. Second, a simple Improved Marching Cubes (IMC) algorithm is proposed.  ...  参 考 文 献 1) Fig Fig . 1 Marching Cubes Nielson G. M.,Hamann B.: The Asymptotic Decider: Resolving the Ambiguity in Maching Cubes, Proc. IEEE Visualization (1991) pp.83-91. 4) Takanori N.,Takeshi A.  ... 
doi:10.3154/jvs.22.1supplement_483 fatcat:sqnvr43bbvbk7iwbmng5wa7sfi

Ambiguous Figures – What Happens in the Brain When Perception Changes But Not the Stimulus

Jürgen Kornmeier, Michael Bach
2012 Frontiers in Human Neuroscience  
During observation of ambiguous figures our perception reverses spontaneously although the visual information stays unchanged.  ...  It revealed that disambiguation of ambiguous visual information takes roughly 50 ms or two loops of recurrent neural activity.  ...  The concurrent alpha-band decrease may reflect two loops of recurrent activity in order to resolve the ambiguity within at most 60 ms.  ... 
doi:10.3389/fnhum.2012.00051 pmid:22461773 pmcid:PMC3309967 fatcat:k353kvet3jaozit6tepo3dygly
« Previous Showing results 1 — 15 out of 336 results