Publication

A general algorithm for 3-D shape interpolation in a facet-based representation

Daniel Thalmann, Nadia Magnenat-Thalmann
1988
Conference Papers

Abstract

Concerned with interpolation between two objects defined using a faceted representation. The interpolation function is not examined, but the paper emphasizes the problem of correspondence between the two given key drawings. The problem is much more complex than interpolation between line drawings, because the two key drawings generally have a different total number of vertices, a different total number of facets and corresponding facets have a different number of vertices. A general algorithm is proposed based on a criterion of minimal dynamic displacement. There are numerous applications of the method: simulation of biological evolution, animation, portrait-robots

Official source

https://infoscience.epfl.ch/entities/publication/def13552-2bcb-47df-b5e4-4f9d92795b73

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Daniel Thalmann, Nadia Magnenat-Thalmann
1988
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/def13552-2bcb-47df-b5e4-4f9d92795b73

About this result

Related concepts (32)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Nearest-neighbor interpolation

Nearest-neighbor interpolation (also known as proximal interpolation or, in some contexts, point sampling) is a simple method of multivariate interpolation in one or more dimensions. Interpolation is the problem of approximating the value of a function for a non-given point in some space when given the value of that function in points around (neighboring) that point. The nearest neighbor algorithm selects the value of the nearest point and does not consider the values of neighboring points at all, yielding a piecewise-constant interpolant.

Engineering drawing

An engineering drawing is a type of technical drawing that is used to convey information about an object. A common use is to specify the geometry necessary for the construction of a component and is called a detail drawing. Usually, a number of drawings are necessary to completely specify even a simple component. The drawings are linked together by a master drawing or assembly drawing which gives the drawing numbers of the subsequent detailed components, quantities required, construction materials and possibly 3D images that can be used to locate individual items.

Related publications (19)

A general algorithm for 3-D shape interpolation in a facet-based representation

Chat with Graph Search

Time-Space Trade-Offs for Sumcheck

MATHICSE Technical Report : Region extraction in mesh intersection

The subtle mechanics of an avalanche – as seen in 3D