Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Olaf Hall-Holt"'
Publikováno v:
The Mathematics Enthusiast. 18:309-324
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e6edf3aa08629fced0bde2f389be503
https://doi.org/10.54870/1551-3440.1526
https://doi.org/10.54870/1551-3440.1526
Publikováno v:
Discrete Applied Mathematics. 159(13):1377-1380
Let spt ( n ) denote Andrews’ smallest part statistic. Andrews discovered congruences for spt ( n ) mod 5 , 7 and 13 which are reminiscent of Ramanujan’s classical partition congruences for moduli 5, 7, and 11. We create an algorithm exploiting a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5b12200361adeb80f0b584309172f44
Publikováno v:
Computational Geometry. 38(3):129-138
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can be as large as many millions. It is sometimes advantageous to render on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52744889e075c3e19d034c7d3a055d4e
Autor:
Olaf Hall-Holt, Kevin R. Sanft
Publikováno v:
SIGCSE
The ability to use computational tools to collect, organize, visualize, and analyze data is a valuable skill both inside and outside of computer science. In this paper we describe the design and implementation of a statistics-infused introduction to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ce8b5a249fb0200de3ad47fe63f83ec
https://doi.org/10.1145/2676723.2677218
https://doi.org/10.1145/2676723.2677218
Publikováno v:
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::872764af7b983345a51d01d4c37994a4
https://doi.org/10.1145/1109557.1109610
https://doi.org/10.1145/1109557.1109610
Publikováno v:
SPIE Proceedings.
Structured-light rangefinder is distinguished from other range scanning systems by its use of off-the-shelf hardware and fast data acquisition. We propose a novel approach to calibrate such a system, namely, calibrate the camera and the projector of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae27cb451c081d41c12785b804000832
https://doi.org/10.1117/12.586209
https://doi.org/10.1117/12.586209
Publikováno v:
Symposium on Computational Geometry
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p,q e P are joined by an edge if the segment ‾pq ⊂ Q. Efficient output-sensitive algorithms are known for the case in which P is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c45ac28440e7cdabffa337e5fa208d3
https://doi.org/10.1145/997817.997825
https://doi.org/10.1145/997817.997825
Autor:
Olaf Hall-Holt
Publikováno v:
Symposium on Computational Geometry
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that "We believe the principal untappedsource of help for hidden surface algorithms lies in frame and object coherence." Making use of such temporal coh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b86be566bb1bb3043056e69f4145be22
https://doi.org/10.1145/997817.997887
https://doi.org/10.1145/997817.997887