default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Visual Computer, Volume 3
Volume 3, Number 1, February 1987
- Ken-ichi Anjyo, Toshio Ochi, Yoshiaki Usami, Yasumasa Kawashima:
A practical method of constructing surface in three-dimensional digitized space. 4-12 - Hiroaki Kobayashi, Tadao Nakamura, Yoshiharu Shigei:
Parallel processing of an object space for image synthesis using ray tracing. 13-22 - Thomas V. Papathomas, Béla Julesz:
Animation with fractals from variations on the Mandelbrot set. 23-26 - Leila De Floriani:
Surface representations based on triangular grids. 27-50 - François Bolduc, Albert Lejeune, Nadia Magnenat-Thalmann:
Image synthesis and 3-D computer animation: a new approach for strategic analysis. 51-56
Volume 3, Number 2, August 1987
- David Blair Kirk:
The simulation of natural features using cone tracing. 63-71 - Michael L. Connolly:
An application of algebraic topology to solid modeling in molecular biology. 72-81 - T. J. Browne, A. J. Fielding:
Automating map production of the 1981 Census data for Brighton and Hove, England. 82-87 - Fujio Yamaguchi:
Theoretical foundations for the 4 x 4 determinant method in computer graphics and geometric modelling. 88-97 - Bruno Arnaldi, Thierry Priol, Kadi Bouatouch:
A new space subdivision method for ray tracing CSG modelled scenes. 98-108
Volume 3, Number 3, October 1987
- Rae A. Earnshaw:
The mathematics of computer graphics. 115-124 - Yong C. Chen:
Lens effect on synthetic image generation based on light particle theory. 125-136 - Kazufumi Kaneda, Koichi Harada, Eihachiro Nakamae, Mineo Yasuda, Akinao G. Sato:
Reconstruction and semi-transparent display method for observing inner structure of an object consisting of multiple surfaces. 137-144 - Nadia Magnenat-Thalmann, M. Burgess, L. Forest, Daniel Thalmann:
A geometric study of parameters for the recursive midpoint subdivision. 145-151 - Charles D. Woodward:
B 2-splines: a local representation for cubic spline interpolation. 152-161 - Sener Ilgen, Isaac D. Scherson:
Real time virtual window management for bit mapped raster graphics. 162-169
Volume 3, Number 4, December 1987
- Willem F. Bronsvoort:
An algorithm for visible-line and visible-surface display of CSG models. 176-185 - André Gagalowicz:
Texture modelling applications. 186-200 - Isaac D. Scherson, Elisha Caspary:
Data structures and the time complexity of ray tracing. 201-213 - Joshua U. Turner, Michael J. Wozny:
Tolerances in computer-aided geometric design. 214-226 - Frank K. H. A. Dehne, Jörg-Rüdiger Sack
:
Translation separability of sets of polygons. 227-235 - Piet Houthuys:
Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching. 236-249
Volume 3, Number 5, March 1988
- Dani Tost, Xavier Pueyo:
Human body animation: a survey. 254-264 - Koji Komatsu:
Human skin model capable of natural shape variation. 265-271 - Monique Nahas, Hervé Huitric, Michel Saintourens:
Animation of a B-Spline figure. 272-276 - David R. Hill, Andrew Pearce, Brian Wyvill:
Animating speech: an automated approach using speech synthesised by rules. 277-289 - Nadia Magnenat-Thalmann, E. Primeau, Daniel Thalmann:
Abstract muscle action procedures for human face animation. 290-297 - Gérard Hégron, Bruno Arnaldi, Thierry Priol:
VISYR: a simulation tool for mobile robots using vision sensors. 298-303 - Kamal Kant, Steven W. Zucker:
Planning collision-free trajectories in time-varying environments: a two-level hierarchy. 304-313
Volume 3, Number 6, May 1988
- David Avis, Binay K. Bhattacharya, Hiroshi Imai:
Computing the volume of the union of spheres. 323-328 - Peter Egyed:
Hidden-surface removal in polyhedral cross-sections. 329-343 - James A. Dean, Andrzej Lingas, Jörg-Rüdiger Sack:
Recognizing polygons, or how to spy. 344-355 - Frank K. H. A. Dehne:
Solving visibility and separability problems on a Mesh-of-Processors. 356-370 - Hossam A. ElGindy, Michael Goodrich:
Parallel algorithms for shortest path problems in polygons. 371-378 - Binay K. Bhattacharya, Godfried T. Toussaint:
Fast algorithms for computing the diameter of a finite planar set. 379-388
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.
last updated on 2025-12-12 01:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
