Sciweavers

2980 search results - page 245 / 596
» Computational Geometry
Sort
View
CGF
1999
125views more  CGF 1999»
15 years 4 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
CAD
2011
Springer
15 years 2 days ago
Smooth Bi-3 spline surfaces with fewest knots
Converting a quadrilateral input mesh into a C1 surface with one bi-3 tensorproduct spline patch per facet is a classical challenge. We give explicit local averaging formulas for ...
Jianhua Fan, Jörg Peters
GRID
2004
Springer
15 years 10 months ago
An Enabling Environment for Distributed Simulation and Visualization
In this paper we present the MASSIVE project that aims to use Grid technology to establish an enabling environment for distributed simulation and visualization of large-scale scie...
Yao Zheng, Guanghua Song, Jifa Zhang, Jianjun Chen...
EWSN
2008
Springer
16 years 4 months ago
Distributed Inference for Network Localization Using Radio Interferometric Ranging
Abstract. A localization algorithm using radio interferometric measurements is presented. A probabilistic model is constructed that accounts for general noise models and lends itse...
Dennis Lucarelli, Anshu Saksena, Ryan Farrell, I-J...
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 2 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...