Sciweavers

969 search results - page 7 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
HPDC
2005
IEEE
14 years 1 months ago
A new metric for robustness with application to job scheduling
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
Darin England, Jon B. Weissman, Jayashree Sadagopa...
APGV
2004
ACM
124views Visualization» more  APGV 2004»
13 years 11 months ago
An experimental approach to predicting saliency for simplified polygonal models
In this paper, we consider the problem of determining feature saliency for 3D objects and describe a series of experiments that examined if salient features exist and can be predi...
Sarah Howlett, John Hamill, Carol O'Sullivan
TIP
2002
97views more  TIP 2002»
13 years 7 months ago
Affine invariants of convex polygons
In this correspondence, we prove that the affine invariants proposed recently by Yang and Cohen [1] are algebraically dependent. We show how to select an independent and complete s...
Jan Flusser
ICPR
2002
IEEE
14 years 12 days ago
A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
Guangming Li, Jie Tian, Mingchang Zhao, Huiguang H...
CGA
2008
13 years 7 months ago
Viewpoint-Based Ambient Occlusion
Ambient occlusion is a powerful technique that mimics indirect global illumination at a fraction of the cost. In this paper, we introduce a new ambient occlusion technique based o...
Francisco González, Mateu Sbert, Miquel Fei...