A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves
- Author
- HAMANN, B1 ; TSAI, P.-Y
[1] Department of Computer Science, University of California, Davis, CA 95616-8562, United States - Source
Computer-aided design. 1996, Vol 28, Num 6-7, pp 461-472 ; ref : 35 ref
- CODEN
- CAIDA5
- ISSN
- 0010-4485
- Scientific domain
- Mechanical engineering; Computer science
- Publisher
- Elsevier Science, Oxford
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme B spline Diagramme Voronoï Interpolation Intersection Représentation Rognage Surface Triangulation Bisector NURBS Scan line algorithm Trimmed surface
- Keyword (en)
- Algorithms B spline Voronoï diagram Interpolation Intersections Representation Trimming Surfaces Triangulation
- Keyword (es)
- B splín Diagrama Voronoi Representación
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B11 Computer aided design
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence / 001D02C03 Pattern recognition. Digital image processing. Computational geometry
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 3105964
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/0010-4485(95)00043-7 
https://dx.doi.org/10.1016/0010-4485(95)00043-7
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0010-4485(95)00043-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:9:\"\u0000*\u0000jtitle\";s:21:\"Computer-aided design\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput.-aided des\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:3:\"6-7\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"472\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-4485\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HAMANN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"TSAI, P.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CAIDA5\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0010-4485(95)00043-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:9:\"\u0000*\u0000jtitle\";s:21:\"Computer-aided design\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput.-aided des\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:3:\"6-7\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"472\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-4485\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HAMANN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"TSAI, P.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CAIDA5\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0010-4485(95)00043-7\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0010-4485(95)00043-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:9:\"\u0000*\u0000jtitle\";s:21:\"Computer-aided design\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput.-aided des\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:3:\"6-7\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"472\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-4485\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HAMANN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"TSAI, P.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CAIDA5\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0010-4485(95)00043-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:9:\"\u0000*\u0000jtitle\";s:21:\"Computer-aided design\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput.-aided des\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:3:\"6-7\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"472\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-4485\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HAMANN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"TSAI, P.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CAIDA5\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/0010-4485(95)00043-7\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:9:\"\u0000*\u0000jtitle\";s:21:\"Computer-aided design\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput.-aided des\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"28\";s:8:\"\u0000*\u0000issue\";s:3:\"6-7\";s:8:\"\u0000*\u0000spage\";s:3:\"461\";s:8:\"\u0000*\u0000epage\";s:3:\"472\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0010-4485\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"HAMANN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"B\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"TSAI, P.-Y\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CAIDA5\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:104:\"A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
