Sciweavers

676 search results - page 50 / 136
» A Search-Free Intersection Algorithm
Sort
View
CGF
2010
132views more  CGF 2010»
13 years 10 months ago
Hybrid Booleans
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
Darko Pavic, Marcel Campen, Leif Kobbelt
CGF
2008
126views more  CGF 2008»
13 years 10 months ago
Part-type Segmentation of Articulated Voxel-Shapes using the Junction Rule
We present a part-type segmentation method for articulated voxel-shapes based on curve skeletons. Shapes are considered to consist of several simpler, intersecting shapes. Our met...
Dennie Reniers, Alexandru Telea
ICPR
2010
IEEE
14 years 3 months ago
Keyframe-Guided Automatic Non-Linear Video Editing
We describe a system for generating coherent movies from a collection of unedited videos. The generation process is guided by one or more input keyframes, which determine the cont...
Vaishnavi Rajgopalan, Ananth Ranganathan, Ramgopal...
COMPGEOM
1991
ACM
14 years 1 months ago
Crossing Families
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
Boris Aronov, Paul Erdös, Wayne Goddard, Dani...
CSJM
2006
81views more  CSJM 2006»
13 years 10 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu