Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Christopher Dyken"'
Autor:
Jon M. Hjelmervik, Christopher Dyken, Trond Runar Hagen, André R. Brodtkorb, Olaf O. Storaasli
Publikováno v:
Scientific Programming, Vol 18, Iss 1, Pp 1-33 (2010)
Node level heterogeneous architectures have become attractive during the last decade for several reasons: compared to traditional symmetric CPUs, they offer high peak performance and are energy and/or cost efficient. With the increase of fine-grained
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a92141cfbf4bb636b1a42e61b3e57434
https://doi.org/10.1155/2010/540159
https://doi.org/10.1155/2010/540159
Publikováno v:
Journal of Geographical Systems. 11:273-289
In this paper we present a method for simultaneous simplification of a collection of piecewise linear curves in the plane. The method is based on triangulations, and the main purpose is to remove line segments from the piecewise linear curves without
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c60f050d7bb2e81a0ff7723c58034675
https://doi.org/10.1007/s10109-009-0078-8
https://doi.org/10.1007/s10109-009-0078-8
Autor:
Christopher Dyken, Michael S. Floater
Publikováno v:
Computer Aided Geometric Design. 26:117-134
Transfinite mean value interpolation has recently emerged as a simple and robust way to interpolate a function f defined on the boundary of a planar domain. In this paper we study basic properties of the interpolant, including sufficient conditions o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b962f51527c66c8197cc94daf3ddfe5f
https://doi.org/10.1016/j.cagd.2007.12.003
https://doi.org/10.1016/j.cagd.2007.12.003
Publikováno v:
Computer Graphics Forum. 27:2028-2039
We present an implementation approach for Marching Cubes (MC) on graphics hardware for OpenGL 2.0 or comparable graphics APIs. It currently outperforms all other known graphics processing units (GPU)-based iso-surface extraction algorithms in direct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0748ab4afdc668226771b7eaf5946a2
https://doi.org/10.1111/j.1467-8659.2008.01182.x
https://doi.org/10.1111/j.1467-8659.2008.01182.x
Publikováno v:
Computer Graphics Forum. 27:1-12
We present an algorithm for detecting and extracting the silhouette edges of a triangle mesh in real time using Graphical Processing Units (GPUs). We also propose a tessellation strategy for visualizing the mesh with smooth silhouettes through a cont
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3335014d3b04855df5ece6fd1839a52
https://doi.org/10.1111/j.1467-8659.2007.01030.x
https://doi.org/10.1111/j.1467-8659.2007.01030.x
Autor:
Kjetil Lye, Jens Olav Nygaard, Trond Runar Hagen, Jon M. Hjelmervik, Christopher Dyken, Johan Simon Seland, Erik W. Bjonnes
Publikováno v:
CloudCom
We present a software framework that facilitates the development of OpenGL applications utilizing the limited GPU capacities of a portable client in combination with the high-end rendering hardware on a server. The resulting web-application uses stan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a2960a4eb49be1be62ef1bbfa21afa
https://hdl.handle.net/11250/2430443
https://hdl.handle.net/11250/2430443
Publikováno v:
Computer graphics forum
We present an adaptive tessellation scheme for surfaces consisting of parametric patches. The resulting tessellations are topologically uniform, yet consistent and watertight across boundaries of patches with different tessellation levels. Our scheme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f63f2f8665443779eeaff737b66f686e
http://hdl.handle.net/11250/2430163
http://hdl.handle.net/11250/2430163
Autor:
Christopher Dyken, Michael S. Floater
Publikováno v:
Computational Geometry. (2):96-101
This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the triangulation can be generated by extending Lawson's edge-swapping algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::588f897acde396defbcc0a1cfe31497d