Sciweavers

341 search results - page 22 / 69
» Decision Complexity in Dynamic Geometry
Sort
View
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
15 years 11 months ago
Combined FDTD/Macromodel Simulation of Interconnected Digital Devices
Behavioral models of digital devices based on Radial Basis Functions (RBF) are incorporated into a Finite-Difference Time-Domain (FDTD) solver for full-wave analysis of interconne...
Stefano Grivet-Talocia, Igor S. Stievano, Ivan A. ...
COCOA
2007
Springer
16 years 2 days ago
Mechanism Design by Creditability
This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional...
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schm...
COMPGEOM
2006
ACM
15 years 12 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
VISUALIZATION
2002
IEEE
15 years 10 months ago
Exploring Surface Characteristics with Interactive Gaussian Images (A Case Study)
The Gauss map projects surface normals to a unit sphere, providing a powerful visualization of the geometry of a graphical object. It can be used to predict visual events caused b...
Bradley C. Lowekamp, Penny Rheingans, Terry S. Yoo
COMPGEOM
2008
ACM
15 years 7 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...