Interactive 3D medical image segmentation with energy-minimizing implicit functions

F Heckel, O Konrad, HK Hahn, HO Peitgen - Computers & Graphics, 2011 - Elsevier
We present an interactive segmentation method for 3D medical images that reconstructs the
surface of an object using energy-minimizing, smooth, implicit functions. This reconstruction …

Discrete event front-tracking simulation of a physical fire-spread model

JB Filippi, F Morandini, JH Balbi, DRC Hill - Simulation, 2010 - journals.sagepub.com
Simulation of moving interfaces such as a fire front usually requires resolution of a large-
scale and detailed domain. Such computing involves the use of supercomputers to process …

Real-time processing of image sources using binary space partitioning

D Schröder, T Lentz - Journal of the Audio Engineering Society, 2006 - aes.org
The current state of the art of virtual reality allows a user to interact with computergenerated
visual worlds and provides a high level of realism. The immersion can be increased …

Application of a two-and-a-half dimensional model-based algorithm to crosswell electromagnetic data inversion

M Li, A Abubakar, TM Habashy - Inverse Problems, 2010 - iopscience.iop.org
In this paper, we apply a model-based inversion scheme for the interpretation of the
crosswell electromagnetic data. In this approach, we use open and closed polygons to …

Two-dimensional mixed mode crack simulation using the material point method

B Wang, V Karuppiah, H Lu… - Mechanics of Advanced …, 2005 - Taylor & Francis
The material point method (MPM) has demonstrated its capabilities in the simulation of
impact/contact/penetration and interfacial crack growth problems. Because of the use of …

Occlusion-free path planning with a probabilistic roadmap

MA Baumann, DC Dupuis, S Léonard… - 2008 IEEE/RSJ …, 2008 - ieeexplore.ieee.org
We present a novel algorithm for path planning that avoids occlusions of a visual target for
an ldquoeye-in-handrdquo sensor on an articulated robot arm. We compute paths using a …

Robust and Optimized Algorithms for the Point‐in‐Polygon Inclusion Test without Pre‐processing

JJ Jimenez, FR Feito, RJ Segura - Computer Graphics Forum, 2009 - Wiley Online Library
In this work we present new point inclusion algorithms for non‐convex polygons. These
algorithms do not perform any pre‐processing or any type of decomposition nor features …

Point-in-convex polygon and point-in-convex polyhedron algorithms with O (1) complexity using space subdivision

V Skala - AIP Conference Proceedings, 2016 - pubs.aip.org
There are many space subdivision and space partitioning techniques used in many
algorithms to speed up computations. They mostly rely on orthogonal space subdivision …

A location based security framework for authenticating mobile phones

L Francis, K Mayes, G Hancke… - Proceedings of the 2nd …, 2010 - dl.acm.org
Although the utilisation of location information in mobile network access systems has given
rise to a variety of applications and services, it is thought that the underlying service …

A mobile interface for navigating hierarchical information space

AP Chhetri, K Zhang, E Jain - Journal of Visual Languages & Computing, 2015 - Elsevier
This paper presents ERELT (Enhanced Radial Edgeless Tree), a tree visualization
approach on modern mobile devices. ERELT is designed to offer a clear visualization of any …