Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Gordon Clapworthy

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Andreas Savva

> Home > Persons > Gordon Clapworthy

Publications

2001
[c15]
- view
  - electronic edition @ zcu.cz (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/wscg/SavvaC01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wscg/SavvaC01
Andreas Savva, Gordon Clapworthy:
The Relationship Between RATS-splines and the Catmull and Clark B-splines. WSCG 2001: 118-123
1998
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/cgi/SavvaC98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cgi/SavvaC98
Andreas Savva, Gordon Clapworthy:
A Method for Filling n-Sided Holes in a Surface. Computer Graphics International 1998: 578-582
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/iv/SavvaC98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iv/SavvaC98
Andreas Savva, Gordon Clapworthy:
Generating a Surface Including an n-Sided Patch so as to Cover an n-Sided Hole. IV 1998: 114-119
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iv/SavvaC98a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iv/SavvaC98a
Andreas Savva, Gordon Clapworthy:
A Recursive Approach to Parametric Surfaces Containing Non-Rectangular Patches. IV 1998: 300-306

a service of

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.