Mesh Optimization

Abstract

We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M sub O, produce a mesh M, of the same topological type as M sub O, that fits the data well and has a small number of vertices. Our approach is to minimize an energy function that explicitly models the competing desires of conciseness of representation and fidelity to the data. We show that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number of vertices n an initially dense mesh of triangles).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1994
Accession Number
ADA277644

Entities

People

  • Hughes Hoppe
  • John McDonald
  • Tom Duchamp
  • Tony Derose
  • Werner Stuetzle

Organizations

  • University of Washington

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Collapse
  • Computer Science
  • Computers
  • Data Sets
  • Engineering
  • Geometric Forms
  • Geometry
  • Linear Programming
  • Lines (Geometry)
  • New York
  • Optimization
  • Range Finders
  • Sequences
  • Statistical Sampling
  • Topology

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design