Reconstruction of Animated Models from Images Using Constrained Deformable Surfaces

Authors:
J. Starck;Adrian Hilton;John Illingworth
Affiliations:
-;-;-
Venue:
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Year:
2002

Citing 7
Cited 4

Computational geometry: an introduction

Computational geometry: an introduction
Linear programming in O(n × 3d2) time

Information Processing Letters
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Small-dimensional linear programming and convex hulls made easy

Discrete & Computational Geometry
Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
A Las Vegas algorithm for linear programming when the dimension is small

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Computer vision for human modelling and analysis

Machine Vision and Applications - Special issue: Human modeling, analysis, and synthesis
Topological active volumes

EURASIP Journal on Applied Signal Processing
Fitting solid meshes to animated surfaces using linear elasticity

ACM Transactions on Graphics (TOG)
Shape from Silhouette Consensus

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new linear incremental method for digital hyperplane1 recognition. The first linear incremental algorithm was given for 8-connected planar lines in [DR95]. Our method recognizes any subset of line in the plane or plane in the space. We present the Megiddo linear programming (LP) algorithm in linear time and describe its adaptation to our problem. Then we explain its improvement toward a linear incremental method.