Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 85 matches
- 2001
- Samir Akkouche, Eric Galin:
Adaptive Implicit Surface Polygonization Using Marching Triangles. Comput. Graph. Forum 20(2): 67-80 (2001) - Pierre Alliez, Mathieu Desbrun:
Valence-Driven Connectivity Encoding for 3D Meshes. Comput. Graph. Forum 20(3): 480-489 (2001) - David B. Arnold, A. M. Day, Vince J. Jennings, A. Courtenay, David A. Duce:
Haptic Device Control - Will it Fit Standardized Input Models? Comput. Graph. Forum 20(4): 245-256 (2001) - Ella Barkan, Dan Gordon:
CP3: Robust, Output-sensitive Display of Convex Polyhedra in Scanline Mode. Comput. Graph. Forum 20(4): 257-269 (2001) - Steffi Beckhaus, Felix Ritter, Thomas Strothotte:
Guided Exploration with Dynamic Potential Fields: the CubicalPath System. Comput. Graph. Forum 20(4): 201-210 (2001) - Jean-Daniel Boissonnat, Frédéric Cazals:
Coarse-to-fine surface simplification with geometric guarantees. Comput. Graph. Forum 20(3): 490-499 (2001) - Mario Botsch, Leif Kobbelt:
Resampling Feature Regions in Polygonal Meshes for Surface Anti-Aliasing. Comput. Graph. Forum 20(3): 402-410 (2001) - David Bourguignon, Marie-Paule Cani, George Drettakis:
Drawing for Illustration and Annotation in 3D. Comput. Graph. Forum 20(3): 114-123 (2001) - David E. Breen, Sean Mauch, Ross T. Whitaker, Jia Mao:
3D Metamorphosis Between Different Types of Geometric Models. Comput. Graph. Forum 20(3): 36-48 (2001) - Normand Brière, Pierre Poulin:
Adaptive Representation of Specular Light. Comput. Graph. Forum 20(2): 149-159 (2001) - Ken Brodlie, Jason D. Wood:
Recent Advances in Volume Visualization. Comput. Graph. Forum 20(2): 125-148 (2001) - Pere Brunet, Isabel Navazo, Jarek Rossignac, Carlos Saona-Vázquez:
Hoops: 3D Curves as Conservative Occluders for Cell Visibility. Comput. Graph. Forum 20(3): 431-442 (2001) - Katja Bühler:
Linear Interval Estimations for Parametric Objects - Theory and Application. Comput. Graph. Forum 20(3): 0 (2001) - Sabine Coquillart, David J. Duke:
Editorial. Comput. Graph. Forum 20(1): 2 (2001) - Sabine Coquillart, David J. Duke:
Editorial. Comput. Graph. Forum 20(2): 66 (2001) - Balázs Csébfalvi, Lukas Mroz, Helwig Hauser, Andreas König, M. Eduard Gröller:
Fast Visualization of Object Contours by Non-Photorealistic Volume Rendering. Comput. Graph. Forum 20(3): 452-460 (2001) - Michael C. Doggett, Anders Kugler, Wolfgang Straßer:
Displacement Mapping using Scan Conversion Hardware Architectures. Comput. Graph. Forum 20(1): 13-26 (2001) - David J. Duke, Roberto Scopigno:
Editorial. Comput. Graph. Forum 20(4): 178 (2001) - Roman Durikovic:
Animation of Soap Bubble Dynamics, Cluster Formation and Collision. Comput. Graph. Forum 20(3): 67-76 (2001) - Ilya Eckstein, Vitaly Surazhsky, Craig Gotsman:
Texture Mapping with Hard Constraints. Comput. Graph. Forum 20(3): 95-104 (2001) - Stephen A. Ehmann, Ming C. Lin:
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition. Comput. Graph. Forum 20(3): 500-511 (2001) - Sergey V. Ershov, Konstantin Kolchin, Karol Myszkowski:
Rendering Pearlescent Appearance Based On Paint-Composition Modelling. Comput. Graph. Forum 20(3): 227-238 (2001) - Jordi Esteve, Pere Brunet, Àlvar Vinacua:
Multiresolution for Algebraic Curves and Surfaces using Wavelets. Comput. Graph. Forum 20(1): 47-58 (2001) - Petr Felkel, Mario Bruckschwaiger, Rainer Wegenkittl:
Implementation and Complexity of the Watershed-from-Markers Algorithm Computed as a Minimal Cost Forest. Comput. Graph. Forum 20(3): 26-35 (2001) - Eugene Fiume:
Obituary, Alain Fournier 1943-2000. Comput. Graph. Forum 20(1): 3-4 (2001) - Bert Freudenberg, Maic Masuch, Thomas Strothotte:
Walk-Through Illustrations. Comput. Graph. Forum 20(3) (2001) - Simon Gibson, Toby Howard, Roger J. Hubbold:
Flexible Image-Based Photometric Reconstruction using Virtual Light Sources. Comput. Graph. Forum 20(3): 203-214 (2001) - Xavier Granier, George Drettakis:
Incremental Updates for Rapid Glossy Global Illumination. Comput. Graph. Forum 20(3): 268-277 (2001) - Markus Gross:
Are Points the Better Graphics Primitives? Comput. Graph. Forum 20(3): xvii (2001) - Jörg Haber, Karol Myszkowski, Hitoshi Yamauchi, Hans-Peter Seidel:
Perceptually Guided Corrective Splatting. Comput. Graph. Forum 20(3): 142-153 (2001)
skipping 55 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-18 15:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint