195 research outputs found
Methods to Measure Map Readability
Creation of maps in real-time web services introduces challenges concerning map readability. Therefore we must introduce analytical measures controlling the readability. The aim of this study is to develop and evaluate analytical readability measures with the help of user tests
Surface design based upon a combined mesh
In this talk, we consider the problem of surface design based upon a mesh that may contain triangu-lar and quadrangular domains. Our goal is to investigate the cases when a combined mesh occurs more preferable for bivariate data interpolation than a pure triangulation
3D haptic needle insertion simulator utilising an agent based spherical voxel model
This paper describes a technique for the real-time modeling of deformable tissue. Specifically geared towards needle insertion simulation, the low computational requirements of the model enable highly accurate haptic feedback to a user without introducing noticeable time delay or buzzing generally associated with haptic surgery simulation. Using a spherical voxel array combined with aspects of computational geometry and agent communication and interaction principals, the model is capable of providing haptic update rates of over 1000Hz with real-time visual feedback. Iterating through over 1000 voxels per millisecond to determine collision and haptic response while making use of Vieta’s Theorem for extraneous force culling. <br /
Консервативный полулагранжевый алгоритм численного решения уравнения неразрывности на неструктурированных треугольных сетках
В статье представлен полулагранжевый алгоритм численного решения двумерного уравнения неразрывности на неструктурированных треугольных сетках. Алгоритмы из семейства полулагранжевых методов являются широкоизвестными численными методами решения уравнения неразрывност
GraphMaps: Browsing Large Graphs as Interactive Maps
Algorithms for laying out large graphs have seen significant progress in the
past decade. However, browsing large graphs remains a challenge. Rendering
thousands of graphical elements at once often results in a cluttered image, and
navigating these elements naively can cause disorientation. To address this
challenge we propose a method called GraphMaps, mimicking the browsing
experience of online geographic maps.
GraphMaps creates a sequence of layers, where each layer refines the previous
one. During graph browsing, GraphMaps chooses the layer corresponding to the
zoom level, and renders only those entities of the layer that intersect the
current viewport. The result is that, regardless of the graph size, the number
of entities rendered at each view does not exceed a predefined threshold, yet
all graph elements can be explored by the standard zoom and pan operations.
GraphMaps preprocesses a graph in such a way that during browsing, the
geometry of the entities is stable, and the viewer is responsive. Our case
studies indicate that GraphMaps is useful in gaining an overview of a large
graph, and also in exploring a graph on a finer level of detail.Comment: submitted to GD 201
Whirling Hexagons and Defect Chaos in Hexagonal Non-Boussinesq Convection
We study hexagon patterns in non-Boussinesq convection of a thin rotating
layer of water. For realistic parameters and boundary conditions we identify
various linear instabilities of the pattern. We focus on the dynamics arising
from an oscillatory side-band instability that leads to a spatially disordered
chaotic state characterized by oscillating (whirling) hexagons. Using
triangulation we obtain the distribution functions for the number of pentagonal
and heptagonal convection cells. In contrast to the results found for defect
chaos in the complex Ginzburg-Landau equation and in inclined-layer convection,
the distribution functions can show deviations from a squared Poisson
distribution that suggest non-trivial correlations between the defects.Comment: 4 mpg-movies are available at
http://www.esam.northwestern.edu/~riecke/lit/lit.html submitted to New J.
Physic
- …