Sciweavers

2583 search results - page 12 / 517
» On the Representation of Timed Polyhedra
Sort
View
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 8 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
COMPGEOM
2008
ACM
13 years 9 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
WSCG
2004
197views more  WSCG 2004»
13 years 9 months ago
Collision Prediction Using MKtrees
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
Marta Franquesa-Niubó, Pere Brunet
PG
2007
IEEE
14 years 2 months ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
CVPR
2012
IEEE
11 years 10 months ago
Recognizing scene viewpoint using panoramic place representation
We introduce the problem of scene viewpoint recognition, the goal of which is to classify the type of place shown in a photo, and also recognize the observer’s viewpoint within ...
Jianxiong Xiao, Krista A. Ehinger, Aude Oliva, Ant...