Sciweavers

278 search results - page 40 / 56
» Discrete Approximations to Continuous Curves
Sort
View
COMPGEOM
2004
ACM
14 years 24 days ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
CMSB
2007
Springer
14 years 1 months ago
A Unifying Framework for Modelling and Analysing Biochemical Pathways Using Petri Nets
We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each per...
David Gilbert, Monika Heiner, Sebastian Lehrack
CVPR
2012
IEEE
11 years 9 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
TVCG
2008
144views more  TVCG 2008»
13 years 7 months ago
Silhouette Smoothing for Real-Time Rendering of Mesh Surfaces
Coarse piecewise linear approximation of surfaces causes undesirable polygonal appearance of silhouettes. We present an efficient method for smoothing the silhouettes of coarse tri...
Lu Wang, Changhe Tu, Wenping Wang, Xiangxu Meng, B...
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
13 years 8 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount