Fresh Mesh: A New Route To Smaller 3-D Files

Date:

June 17, 2004

Source:

University Of Southern California

Summary:

A University of Southern California computer scientist has created a powerful and elegant algorithm to compress the large and ungainly files that represent 3-D shapes used in animations, video games and other computer graphics applications.

Share:

Total shares:

FULL STORY

Simplifying by condensing small triangles (colored) into larger ones, and then into polygons.

Credit: Image courtesy University Of Southern California

Simplifying by condensing small triangles (colored) into larger ones, and then into polygons.

Credit: Image courtesy University Of Southern California

A University of Southern California computer scientist has created a powerful and elegant algorithm to compress the large and ungainly files that represent 3-D shapes used in animations, video games and other computer graphics applications.

Mathieu Desbrun, assistant professor of computer science at the USC Viterbi School of Engineering says that digital sound, pictures and video are relatively easy to compress today but that the complex files of 3-D objects present a much greater challenge.

"We simply did not have the tools to deal efficiently and accurately with three-dimensional digital geometry," he says. Desbrun will present his solution to the problem at this summer's 2004 SIGGRAPH convention in Los Angeles.

The "Variational Shape Approximation" scheme he created with two collaborators produces simplified but highly accurate "meshes" representing 3-D shapes. The meshes are orders of magnitude smaller than those produced by existing ways of handling such files but remain completely compatible with all widely used methods to display and use the information.

"The beauty of their approach," says Professor Peter Schoeder of Caltech, who is leader of the Multi-Res modeling group and an expert in the field, "lies in its robustness, solid mathematical foundations, and speed for (very complex) geometries of interest."

* Retailers are starting to use them to display products on websites so that viewers can manipulate and view then from alternate angles, offering unrivaled interactivity in comparison to still images.

* Museums now put sculptures, vases, carvings and other 3-D images online so that visitors can virtually walk around them and examine details closely from many angles.

* Designers of cartoon characters or video games use them so that they can instantly present, for example, Shrek's face from above, from the side, from below, or even from the point of view of an ant walking on it.

For all these uses and others, more compact files will facilitate the sharing and processing of virtually any geometric dataset.

The 33-year-old Desbrun, who won the "Significant New Researcher" Award at the 2003 ACM SIGGRAPH conference, is a member of the Viterbi School's National Science Foundation-funded Integrated Media Systems Center. He worked with two former post doctoral researchers – Pierre Alliez, now with France's INRIA (National Institute for Research in Information and Automation); and David Cohen-Steiner, now of Duke University.

Desbrun says that the data output from current 3-D scanners consists of a mesh of connected triangles and has many more triangles than is necessary to represent the shape. The data is redundant and costly to further process.

An alternative route: the Desbrun group's algorithm, analyzes a shape (left) into "proxy" areas (center) that are then used to create a rough mesh of flat polygons providing a compact approximation of the shape, which can then be refined.

"Even if a region is completely flat," Desbrun says, "it may be scanned into a bunch of uneven triangles, adding unnecessary complexity."

Desbrun explains that his accomplishment was to simplify such a mesh, by combining as many of the little triangles as possible into larger elements without compromising the actual shape. Nearly flat regions are efficiently represented by one large, flat mesh element while curved regions require more mesh elements.

Computer scientists have struggled with the problem of finding an optimal mix of large and small elements for years. In 1998, theoreticians proved that the problem was "NP hard" -- that no general solution exists that can be solved by a computer in finite length of time. They did find work-arounds: fast methods to simplify meshes, which were unable to guarantee accuracy, and accurate techniques, which were too slow.

The Desbrun team's novel approach comes from the seemingly unrelated field of machine learning using a technique invented in 1959 called "Lloyd Clustering" named after its inventor Stuart Lloyd. Desbrun's algorithm uses it to automatically segment an object into a group of non-overlapping connected regions – an instant draft alternative to the too-numerous triangles of the original scan.

Then the method provides a fast and accurate way to test these alternative larger regions – called proxies – for their fit to the object, and successively optimize them in a small number of iterations. The process also allows direct manipulation of the results for special purposes by the user – making it a very convenient tool for digital artists in animation studios. The user can select particular areas of a 3-D representation to make them either less or more detailed, or to emphasize them.

"For instance, when approximating a human face with very few proxies, the eyes may not be apparent." But a user can adjust the technique to fine-tune the eye region while leaving other areas in rougher form.

The method also allows users to fine tune areas where the method has reached a dead end by giving hints, in the form of a "seed triangle."

The proxy representation, once refined, is then reconverted into a now-optimized mesh -- but not necessarily a mesh of triangles. The technique turns them instead into an assortment of polygons -- some triangles, but also four, five, six or more sided figures that more efficiently represent the shape. These in turn feed seamlessly into standard software to represent 3-D shapes on computer screens, or for other uses.

"This is not a hack," says another expert, in the field Gerard Medioni, professor of computer science and chair of the department at the Viterbi School, using the term for a makeshift, unsystematic improvisation. "It has a strong formal basis. You can make up extreme cases that will trick it, but for ordinary shapes, it works remarkably well."

"We believe this approach to geometry approximation offers both solid foundations and unprecedented results," said Desbrun.

"Combined with the other recent advances of our research lab on mesh compression, it is a significant step to facilitate use of 3-D geometry in many areas."

July 30, 2015  It is possible to predict the timing and intensity of influenza outbreaks in subtropical climates like Hong Kong where flu seasons can occur at different times and more than once during a year, ... read more

July 30, 2015  A new automated data mining system could lead to a dramatic increase in the detection of potentially illegal online sales of elephant ivory through eBay. Law enforcement agencies and conservationist ... read more

July 28, 2015  Researchers explain how the new paradigm of a digital healthcare system, as it matures, is putting the picture of the doctor-patient relationship in an entirely new frame and not always in a positive ... read more

July 23, 2013  It would be impossible to compute all of the ways a piece of cloth might shift, fold and drape over a moving human figure. But after six months of computation, researchers are pretty sure ... read more