• Non ci sono risultati.

[1] S.Santini, “Tecniche efficienti per l’analisi della propagazione elettromagnetica ad alta frequenza in ambienti complessi (outdoor/indoor)”, tesi di laurea, Università di Pisa, AA 2003/04

N/A
N/A
Protected

Academic year: 2021

Condividi "[1] S.Santini, “Tecniche efficienti per l’analisi della propagazione elettromagnetica ad alta frequenza in ambienti complessi (outdoor/indoor)”, tesi di laurea, Università di Pisa, AA 2003/04 "

Copied!
3
0
0

Testo completo

(1)

122

Bibliografia

[1] S.Santini, “Tecniche efficienti per l’analisi della propagazione elettromagnetica ad alta frequenza in ambienti complessi (outdoor/indoor)”, tesi di laurea, Università di Pisa, AA 2003/04

[2] R.Hoppe, G.Wölfle, G.M Landstorfer, “Accelerated ray-optical propagation modeling for the planning of wireless communications systems”, RAWCON 99, 159- 162, Denver, August 1999

[3] J.Airey, J.Rohlf, F.Brooks, Jr., “Toward image realism with interactive update rates in complex virtual building environments”, ACM Computer Graphics, Proceedings of Symposium on Interactive 3D Graphics, 24, 41-49, 1990

[4] M.F. Catedra, J. Perez, F. Saez de Adana, “Efficient ray-tracing techniques for three dimensional analyses of propagation in mobile communications: application to picocell and microcell scenarios”, IEEE Antennas and Propagation Magazine, Vol.

40, No. 2, April 1998.

[5] F.Cuccu, “Ottimizzazione di uno strumento software per il calcolo delle emissioni elettromagnetiche sul territorio”, tesi di laurea, Università di Pisa, AA 2000/2001.

[6] M.F. Cátedra, J. Pérez-Arriaga, “Cell planning for wireless communications”, Artech House Publishers, 1999.

[7] J. Bittner, P. Wonka, “Visibility in Computer Graphics”, TR-186-2-03-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2001.

[8] P. Wonka, M. Wimmer, D. Schmalstieg, “Visibility preprocessing with occluder

fusion for urban walkthroughs”, Proceedings of the 11

th

EUROGRAPHICS

Workshop on Rendering, 71-82, 2000.

(2)

123 [9] S.J. Chapman, “FORTRAN 90/95 – guida alla programmazione”, seconda edizione, McGraw-Hill, 2004.

[10] R.A. Schumacker, R. Brand, M. Gilliland, W. Sharp, “Study for applying computer generated images to visual generation”, AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory, 1969.

[11] W.Thibault, B. Naylor, “Set operations on polyhedra using Binary Space Partitioning trees”, Proceedings of SIGGRAPH ’87. In Computer Graphics, 21:4, 153-162, July 1987.

[12] B.Naylor, J. Amanatides, W. Thibault, “Merging BSP trees yields polyhedral set operations”, Proceedings of SIGGRAPH ’90, 115-124, August 1990.

[13] H. Fuchs, Z. M. Kedem, B. F. Naylor, “On visible surface generation by a priori tree structures”, Proceedings of SIGGRAPH ’80. In Computer Graphics, 14:3, 124- 133, July 1980.

[14] N. Chin, S. Feiner, “Near real-time shadow generation using BSP trees”, Computer Graphics, 23:3, 99-106, August 1989.

[15] M. Pocchiola, G. Vegter, “The visibility complex”, Proceedings of 9

th

Annual ACM Symposium on Computational Geometry, 328-337, 1993.

[16] J. Bittner, J.Přikryl, “Exact regional visibility using line space partitioning”, Technical Report TR-186-2-01-06, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2001.

[17] J.Bittner, P.Wonka, M.Wimmer, “Visibility preprocessing for urban scenes using Line Space Subdivision”, 9

th

Pacific Conference on Computer Graphics and Applications, 276-284, IEEE, October 2001.

[18] Marco Abate, “Geometria”, McGraw-Hill, 1996.

[19] J. Stolfi, “Oriented Projective Geometry”, ACM Proceedings of the 3

rd

Annual

Symposium on Computational Geometry, October 1987.

(3)

124 [20] J.F. Adams, “Algebric topology: a student’s guide”, Cambridge University Press, 1972.

[21] F. Milicchio, “SBSP: Stokes BSP. Una struttura dati per il calcolo del cobordo e

di forme differenziali”, tesi di laurea, Università degli studi di Roma Tre, AA

2001/02.

Riferimenti

Documenti correlati

• Eseguito dall'applicazione (SW) – richiede algoritmi e strutture dati appositi – ogni cull può essere oneroso (overhead) – ma scarta primitive presto presto presto presto e

[r]

[r]

Flat shading Goraund shading Phong Shading (*) talvolta (ma impropriamente) detto: per-pixel lighting. quando si usano normali

[r]

di vista riflessa dalla norm.). Environment

[r]

quali coordinate assegnare al nuovo vertice?. Ogni schema di suddivisone ha la