On Mon, Jun 26, 2006 at 02:25:31PM +0200, Martin Weisel wrote:
>
> i would like to re-implement the mesh-generating algorithm in Java.
> Is there a reference paper? If not, how does the algorithm works?
> I`m particulary interested in generation of nice, nearly equidistant points.
>
There are two typical algorithms for this purpose, the "O" method:
@incollection{diamond:82,
AUTHOR = {Diamond, R.},
EDITOR = {Sayre, D.},
TITLE = {Two Contouring Algorithms},
BOOKTITLE = {Computational Crystallography},
YEAR = {1982},
PAGES = {267-272},
PUBLISHER = {Oxford University Press},
ADDRESS = {New York},
KEYWORDS = {}
}
and any one of the permutations on the marching cubes/tetrahedra
algorithms, partly described here:
@inproceedings{lorensen:87,
AUTHOR = {Lorensen, W. E. and Cline, H. E.},
TITLE = {Marching cubes: A high resolution 3D surface construction
algorithm.},
BOOKTITLE = {SIGGRAPH 1987 Conference Proceedings},
EDITOR = {Stone, M. C.},
MONTH = {July},
YEAR = {1987},
VOLUME = {21},
PAGES = {163-169},
PUBLISHER = {ACM Press},
ADDRESS = {New York},
KEYWORDS = {}
}
The latter algorithms are part of GTS, if you're looking for some
code and more references:
http://gts.sourceforge.net/
along with other sources (google for Paul Bourke's websites for some
more goodies).
HTH,
Tim
--
---------------------------------------------------------
Tim Fenn
f...@stanford.edu
Stanford University, School of Medicine
James H. Clark Center
318 Campus Drive, Room E300
Stanford, CA 94305-5432
Phone: (650) 736-1714
FAX: (650) 736-1961
---------------------------------------------------------
