Martin Reddy (mxr++at++dcs.ed.ac.uk)
Wed, 12 Jun 1996 11:57:00 +0100 (BST)
If by "de-faceting" you mean polygon simplification (i.e. a process which
creates a simpler polygon model of an original object). Then I would
suggest that you take a look at Carl Erikson's UNC technical report which
presents a very good overview of such techniques:
++at++TECHREPORT{ERIKSON,
AUTHOR = "Carl Erikson",
TITLE = "{Polygonal Simplification: An Overview}",
YEAR = "1996",
TYPE = "{UNC Technical Report No. TR96-016}",
ADDRESS = "Chapel Hill, NC",
INSTITUTION = "Deptartment of Computer Science, University
of North Carolina"
}
This is available on-line from their ftp site: ftp.cs.unc.edu (sorry I
can't give you a full path right now, but I'm getting a "No Route to Host"
error from here). (If you can't find it, then I can e-mail a copy)
Perhaps the simplest technique is the one reported by Rossignac and Borrel
(1992), but there are a number of factors you may want to work out in
order to find the best algorithm for your application (e.g. do you want
topology preserving, is speed a factor etc.)
Martin.
+============================================================================+
| Martin Reddy Dept. of Computer Science |
| University of Edinburgh |
| e-mail : mxr++at++dcs.ed.ac.uk Mayfield Road, EH9 3JZ |
| http://www.dcs.ed.ac.uk/home/mxr/ Tel : (0131) 650 5164 |
+============================================================================+
=======================================================================
List Archives, FAQ, FTP: http://www.sgi.com/Technology/Performer.html
Submissions: info-performer++at++sgi.com
Admin. requests: info-performer-request++at++sgi.com
This archive was generated by hypermail 2.0b2 on Mon Aug 10 1998 - 17:53:00 PDT