Sciweavers

2638 search results - page 417 / 528
» Random Geometric Complexes
Sort
View
COMGEO
2006
ACM
13 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
COMGEO
2007
ACM
13 years 9 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
JCC
2006
110views more  JCC 2006»
13 years 9 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
PRL
2008
198views more  PRL 2008»
13 years 9 months ago
Pose estimation and tracking using multivariate regression
This paper presents an extension of the relevance vector machine (RVM) algorithm to multivariate regression. This allows the application to the task of estimating the pose of an a...
Arasanathan Thayananthan, Ramanan Navaratnam, Bj&o...
SMA
2008
ACM
157views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Interactive physically-based shape editing
We present an alternative approach to standard geometric shape editing using physically-based simulation. With our technique, the user can deform complex objects in real-time. The...
Johannes Mezger, Bernhard Thomaszewski, Simon Pabs...