Hiroaki Chiyokura

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 Toshiaki Satoh

> Home > Persons > Hiroaki Chiyokura

Publications

1991
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/vc/ToriyaTSC91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vc/ToriyaTSC91
Hiroshi Toriya, Teiji Takamura, Toshiaki Satoh, Hiroaki Chiyokura:
Boolean operations for solids with free-form surfaces through polyhedral approximation. Vis. Comput. 7(2): 87-96 (1991)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/ifip5-10/SatohTTC91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip5-10/SatohTTC91
Toshiaki Satoh, Teiji Takamura, Hiroshi Toriya, Hiroaki Chiyokura:
Boolean Operations on Solids Bounded by a Variety of Surfaces. Modeling in Computer Graphics 1991: 141-154
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/sma/SatohC91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sma/SatohC91
Toshiaki Satoh, Hiroaki Chiyokura:
Boolean operations on sets using surface data. Symposium on Solid Modeling and Applications 1991: 119-126
1986
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/cga/ToriyaSUC86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cga/ToriyaSUC86
Hiroshi Toriya, Toshiaki Satoh, Kenji Ueda, Hiroaki Chiyokura:
UNDO and REDO Operations for Solid Modeling. IEEE Computer Graphics and Applications 6(4): 35-42 (1986)

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.