Sciweavers

243 search results - page 14 / 49
» Drawing Borders Efficiently
Sort
View
TOMS
2008
87views more  TOMS 2008»
13 years 7 months ago
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
Hassan Goldani-Moghaddam, Wayne H. Enright
GRAPHICSINTERFACE
2009
13 years 5 months ago
Handle Flags: efficient and flexible selections for inking applications
There are a number of challenges associated with content selection in pen-based interfaces. Supplementary buttons to enter a selection mode may not be available, and selections ma...
Tovi Grossman, Patrick Baudisch, Ken Hinckley
DALT
2006
Springer
13 years 11 months ago
When Agents Communicate Hypotheses in Critical Situations
This paper discusses the problem of efficient propagation of uncertain information in dynamic environments and critical situations. When a number of (distributed) agents have only ...
Gauvain Bourgne, Nicolas Maudet, Suzanne Pinson
DSN
2009
IEEE
13 years 11 months ago
HC-BGP: A light-weight and flexible scheme for securing prefix ownership
The Border Gateway Protocol (BGP) is a fundamental building block of the Internet infrastructure. However, due to the implicit trust assumption among networks, Internet routing re...
Ying Zhang, Zheng Zhang, Zhuoqing Morley Mao, Y. C...
COMGEO
2006
ACM
13 years 7 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw