


default search action
Graphical Models, Volume 73
Volume 73, Number 1, January 2011
- Alexander V. Evako:
Characterizations of simple points, simple edges and simple cliques of digital spaces: One method of topology-preserving transformations of digital spaces by deleting simple points and edges. 1-9 - Shaoting Zhang
, Junzhou Huang
, Dimitris N. Metaxas:
Robust mesh editing using Laplacian coordinates. 10-19
Volume 73, Number 2, March 2011
- Ron Goldman:
Understanding quaternions. 21-49 - Michael Barton
, Gershon Elber:
Spiral fat arcs - Bounding regions with cubic convergence. 50-57
Volume 73, Number 3, May 2011
- Guo-Xin Zhang, Song-Pei Du, Yu-Kun Lai, Tianyun Ni, Shi-Min Hu:
Sketch guided solid texturing. 59-73 - Minjung Son
, Yunjin Lee, Henry Kang, Seungyong Lee:
Structure grid for directional stippling. 74-87
Volume 73, Number 4, July 2011
- Pei Zhou, Wen-Han Qian:
Blending multiple parametric normal ringed surfaces using implicit functional splines and auxiliary spheres. 87-96 - Thiago Pereira, Emilio Vital Brazil, Ives Macêdo
, Mario Costa Sousa
, Luiz Henrique de Figueiredo
, Luiz Velho:
Sketch-based warping of RGBN images. 97-110 - Anton Bardera
, Imma Boada
, Miquel Feixas
, Jaume Rigau, Mateu Sbert
:
Multiresolution image registration based on tree data structures. 111-126 - Jun Wang
, Zeyun Yu:
Quality mesh smoothing via local surface fitting and optimum projection. 127-139
Volume 73, Number 5, September 2011
- Ji-yong Kwon, In-Kwon Lee
:
An animation bilateral filter for slow-in and slow-out effects. 141-150 - Mattia Natali, Silvia Biasotti
, Giuseppe Patanè
, Bianca Falcidieno:
Graph-based representations of point clouds. 151-164 - Alexander A. Pasko
, Oleg Fryazinov
, Turlif Vilbrandt, Pierre-Alain Fayolle, Valery Adzhiev:
Procedural function-based modelling of volumetric microstructures. 165-181 - Juan José Jiménez-Delgado
, Francisco Ramón Feito
, Rafael Jesús Segura
:
Tetra-trees properties in graphic interaction. 182-201 - Javad Sadeghi, Faramarz F. Samavati:
Smooth reverse Loop and Catmull-Clark subdivision. 202-217 - Libor Vása
:
Optimised mesh traversal for dynamic mesh compression. 218-230 - André Maximo
, Robert Patro, Amitabh Varshney
, Ricardo C. Farias:
A robust and rotationally invariant local surface descriptor with applications to non-local mesh processing. 231-242 - Andreas Aristidou
, Joan Lasenby
:
FABRIK: A fast, iterative solver for the Inverse Kinematics problem. 243-260 - Lidija Comic, Leila De Floriani:
Dimension-independent simplification and refinement of Morse complexes. 261-285 - Kestutis Karciauskas, Jörg Peters
:
Rational G2 splines. 286-295 - Jorge Ernesto Rodríguez, Irving Cruz
, Eduard Vergés, Dolors Ayala
:
A connected-component-labeling-based approach to virtual porosimetry. 296-310
Volume 73, Number 6, November 2011
- Valentin E. Brimkov, Reneta P. Barneva:
Computational modeling of objects represented in images. 311-312
- Rez Khan, Qin Zhang, Shayan Darayan, Sankari Dhandapani, Sucharit Katyal
, Clint Greene, Chandrajit L. Bajaj
, David Ress:
Surface-based analysis methods for high-resolution functional magnetic resonance imaging. 313-322 - Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov:
Connected distance-based rasterization of objects in arbitrary dimension. 323-334 - Gábor Németh, Péter Kardos, Kálmán Palágyi:
Thinning combined with iteration-by-iteration smoothing for 3D binary images. 335-345 - Aurélie Richard, Laurent Fuchs, Gaëlle Largeteau-Skapin, Eric Andres:
Decomposition of nD-rotations: Classification, properties and algorithm. 346-353 - Eric Andres, Gaëlle Largeteau-Skapin
, Marc Rodríguez:
Generalized Perpendicular Bisector and exhaustive discrete circle recognition. 354-364 - László Varga
, Péter Balázs
, Antal Nagy
:
Direction-dependency of binary tomographic reconstruction algorithms. 365-375

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.