From: David T. Chen (dave++at++nlm.nih.gov)
Date: 12/19/2000 06:26:51
> From: "Lee Willis" <lee-willis++at++home.com>
> Date: Mon, 18 Dec 2000 11:56:23 -0800
> Subject: RE: polygon reducer
>
> Marcin has given you references to mesh simplifiers.
>
> If you do really want a _polygon_ simplifier, search the web for the
> Douglas/Peucker polyline/polygon reduction algorithm.
>
> Lee Willis
>
> > -----Original Message-----
> > From: Marcin Romaszewicz [mailto:marcin++at++asmodean.engr.sgi.com]
> > Sent: Monday, December 18, 2000 11:32 AM
> > To: Christopher Lindinger
> > Cc: info-performer++at++sgi.com
> > Subject: Re: polygon reducer
> >
> >
> >
> > Try looking around the web and in research publications for papers on mesh
> > simplification. Several papers come to mind:
> >
> > - William Schroeder, Jonathan Zarge, and William Lorensen. Decimation of
> > triangle meshes. SIGGRAPH 1992 Proceedings
> >
> > - Larry Schumaker. Computing optimal triangulations using simulated
> > annealing. Computer-Aided Geometric Design, 10(3-4):329-345, August 1993
> >
> > - Hoppe, Derose, Duchamp, McDonald and Stuetzle. Mesh Optimization.
> > SIGGRAPH 1993 Proceedings
> >
> > - Hughes Hoppe. Progressive Meshes. SIGGRAPH 1996 Proceedings
> >
> > - There's a section about it in Hughes Hoppe's thesis:
> > http://www.research.microsoft.com/~hoppe/thesis/thesis.html
A couple other examples are Jon Cohen's Simplifaction Envelopes at:
http://www.cs.unc.edu/~geom/envelope.html
and Michael Garland's Qslim.
http://graphics.cs.uiuc.edu/~garland/software/qslim.html
Garlands code is the fastest I've seen.
Also Will Schroeder's algorithm is implemented in the VTK source code.
Dave Chen
dave++at++nlm.nih.gov
--
___( mailto:dave++at++nlm.nih.gov, http://visual.nlm.nih.gov/~dave )___
The only thing that allows me to keep my slender grip on reality
is the friendship I share with my collection of singing potatoes.
-- Holly, "Red Dwarf"
This archive was generated by hypermail 2b29 : Tue Dec 19 2000 - 06:26:43 PST