Sciweavers

210 search results - page 12 / 42
» Fast Global Optimization of Curvature
Sort
View
CGF
2006
191views more  CGF 2006»
13 years 7 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
IMR
2004
Springer
14 years 26 days ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso
SIAMIS
2010
167views more  SIAMIS 2010»
13 years 2 months ago
Global Solutions of Variational Models with Convex Regularization
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
CVPR
2000
IEEE
13 years 12 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
ACL
2007
13 years 9 months ago
Fast Unsupervised Incremental Parsing
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structur...
Yoav Seginer