Sciweavers

VC
2008
95views more  VC 2008»
13 years 4 months ago
High frequency geometric detail manipulation and editing for point-sampled surfaces
In this paper, based on the new definition of high frequency geometric detail for point-sampled surfaces, a new approach for detail manipulation and a detail-preserving editing fra...
Yongwei Miao, Jieqing Feng, Chunxia Xiao, Qunsheng...
TSMC
2008
122views more  TSMC 2008»
13 years 4 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin
JGT
2007
81views more  JGT 2007»
13 years 4 months ago
Pathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
David Coudert, Florian Huc, Jean-Sébastien ...
CAD
2005
Springer
13 years 4 months ago
Industrial geometry: recent advances and applications in CAD
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
TIP
2008
108views more  TIP 2008»
13 years 4 months ago
Geometry-Based Distributed Scene Representation With Omnidirectional Vision Sensors
Abstract--This paper addresses the problem of efficient representation of scenes captured by distributed omnidirectional vision sensors. We propose a novel geometric model to descr...
Ivana Tosic, Pascal Frossard
CVIU
2007
120views more  CVIU 2007»
13 years 4 months ago
A comparison of Gaussian and mean curvature estimation methods on triangular meshes of range image data
Estimating intrinsic geometric properties of a surface from a polygonal mesh obtained from range data is an important stage of numerous algorithms in computer and robot vision, co...
Evgeni Magid, Octavian Soldea, Ehud Rivlin
ENDM
2008
142views more  ENDM 2008»
13 years 4 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 4 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
COMCOM
2008
62views more  COMCOM 2008»
13 years 4 months ago
Scalable multicasting with network-aware geometric overlay
It is crucial to design an efficient network-aware overlay network to enable multicast service to adjust under the dynamic underlying network conditions and node churn in a scalab...
Eng Keong Lua, Xiaoming Zhou, Jon Crowcroft, Piet ...
CGA
2008
13 years 4 months ago
Representing Rotations and Orientations in Geometric Computing
Geometric computing with three-dimensional rotations and orientations is a fundamental issue in three-dimensional computer graphics. Our approach was inspired by affine geometry a...
Jehee Lee