default search action
Cornelius W. A. M. van Overveld
Publications
- 2004
- [j29]Kees van Overveld, Brian Wyvill:
Shrinkwrap: An efficient adaptive algorithm for triangulating an iso-surface. Vis. Comput. 20(6): 362-379 (2004) - [c17]Brian Wyvill, Cornelius W. A. M. van Overveld, Sheelagh Carpendale:
Rendering cracks in Batik. NPAR 2004: 61-149 - 2003
- [c16]Jarke J. van Wijk, Cornelius W. A. M. van Overveld:
Preset based interaction with high dimensional parameter spaces. Data Visualization: The State of the Art 2003: 391-406 - 2002
- [c14]Sviataslau Pranovich, Jarke J. van Wijk, Kees van Overveld:
The KITE geometry manipulator. CHI Extended Abstracts 2002: 764-765 - 2001
- [j27]Ahmad H. Nasri, Cornelius W. A. M. van Overveld, Brian Wyvill:
A Recursive Subdivision Algorithm for Piecewise Circular Spline. Comput. Graph. Forum 20(1): 35-45 (2001) - 2000
- [j26]Oliver Deussen, Stefan Hiller, Cornelius W. A. M. van Overveld, Thomas Strothotte:
Floating Points: A method for computing stipple drawings. Comput. Graph. Forum 19(3): 41-50 (2000) - 1997
- [j25]Alexandru C. Telea, Cornelius W. A. M. van Overveld:
The Close Objects Buffer: A Sharp Shadow Detection Technique for Radiosity Methods. J. Graphics, GPU, & Game Tools 2(2): 1-8 (1997) - [j22]Cornelius W. A. M. van Overveld, Brian Wyvill:
Polygon Inflation for Animated Models: a Method for the Extrusion of Arbitrary Polygon Meshes. Comput. Animat. Virtual Worlds 8(1): 3-16 (1997) - [j21]Cornelius W. A. M. van Overveld, Brian Wyvill:
Phong Normal Interpolation Revisited. ACM Trans. Graph. 16(4): 397-419 (1997) - [c7]Cornelius W. A. M. van Overveld, Brian Wyvill:
An Algorithm for Polygon Subdivision Based on Vertex Normals. Computer Graphics International 1997: 3-12 - [c6]Brian Wyvill, Kees van Overveld:
Warping as a modelling tool for CSG/implicit models. Shape Modeling International 1997: 205-213 - [c5]Alexandru C. Telea, Cornelius W. A. M. van Overveld:
An Object-Oriented Interactive System for Scientific Simulations: Design and Applications. VisMath 1997: 207-220 - 1996
- [j20]Huub van de Wetering, Kees van Overveld:
Chain Codes and Their Application in Curve Design. CVGIP Graph. Model. Image Process. 58(5): 464-470 (1996) - [j19]Brian Wyvill, Kees van Overveld:
Polygonization of Implicit Surfaces with Constructive solid Geometry. Int. J. Shape Model. 2(4): 257-274 (1996) - [j18]Cornelius W. A. M. van Overveld, Brian Wyvill:
Hi-speed, Hi-fi, Hi-lights: A Fast Algorithm for the Specular Term in the Phong Illumination Model. J. Graphics, GPU, & Game Tools 1(2): 25-30 (1996) - [j17]Cornelius W. A. M. van Overveld, Brian Wyvill:
Banishing Bad Buckling. J. Graphics, GPU, & Game Tools 1(3): 13-28 (1996) - 1988
- [j1]Marloes L. P. van Lierop, Cornelius W. A. M. van Overveld, Huub M. M. van de Wetering:
Line rasterization algorithms that satisfy the subset line property. Comput. Vis. Graph. Image Process. 41(2): 210-228 (1988) - 1986
- [c1]Cornelius W. A. M. van Overveld, Marloes L. P. van Lierop:
A consistent algorithm to fill triangles and triangular patches. Eurographics 1986
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.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint