A (Possibly) Linear Time, Greedy, Bottom-Up, Algorithm Using Quadtrees for Decimating Topologies via Steiner Triangular Meshes

by Jack Perdue

How to Run

/**                     
 * This software and documentation is the confidential and proprietary 
 * information of Jack Perdue d.b.a. Silicon Slick's Software, Supplies
 * and Support Services (a.k.a. 6S Computers) ("Confidential Information").  
 * You shall not disclose such Confidential Information and shall use 
 * it only in accordance with the terms of the license agreement you 
 * entered into with Jack Perdue. 
 *
 * JACK PERDUE MAKES NO REPRESENTATIONS OR WARRANTIES ABOUT THE SUITABILITY OF 
 * THE SOFTWARE, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, 
 * OR NON-INFRINGEMENT. JACK PERDUE SHALL NOT BE LIABLE FOR ANY DAMAGES
 * SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR DISTRIBUTING
 * THIS SOFTWARE OR ITS DERIVATIVES.
 *
 * Developed by Jack Perdue (a.k.a. Silicon Slick)
 * Copyright (c) 1998 Silicon Slick's Software, Supplies and Support Services
 * All Rights Reserved
 */

[back to License Agreement]

Note: this is a 700KB download, no matter which way you choose to go about it

Until such time as I supply a certificate for this applet, it will be limited as to what you can do with it. For now, your options are:

Last updated: June 28, 1998
Jack Perdue/jack@cs.tamu.edu
Department of Computer Science
College of Engineering
Texas A&M University