Bibliografía

123
Bibliografía
[Aguilera98]
A. Aguilera. “Orthogonal Polyhedra: Study and Application”.
Doctoral Thesis, Barcelona, pp. 1:1-2:27 (Abril 1998).
[Arguelles00]
R. Argüelles. “Implementación de un sistema para la manipulación
y visualización de poliedros basado en árboles octales”. Tesis de
Licenciatura, Puebla, México (Diciembre 2000).
[Austin99]
C. Austin y M. Pawlan. “Chapter5: Java Native Interface (JNI)
Technology“. Advanced Programming for the Java T M 2 Platform.
http://developer.java.sun.com/developer/onlineTraining/Programm
ing/JDCBook/jni.html
[AWT]
“The AWT Native Interface”. SUN Microsystems.
http://java.sun.com/j2se/1.3/docs/guide/awt/AWT_Native_Interfac
e.html
[Ayala85]
D. Ayala, P. Brunet, R. Juan y I. Navazo. “Object Representation
by Means of Nonminimal Division Quadtrees and Octrees”. ACM
Transactions on Graphics 4(1), pp. 41-59 (Enero 1985).
[Ayala91]
D. Ayala, F. Battle, P. Brunet e I. Navazo. “Boolean Operations
between Extended OctTrees”. Report LSI-91-31, Universitat
Politècnica de Catalunya, Barcelona, Spain (1991).
[Baldazzi96]
C. Baldazzi y A. Paoluzzi. “Bijective Dimension-Independent
Boundary to Interior Mapping with BSP Trees”. TR-INF-17-96,
Università Degli Studi di Roma Tre, Dipartimento di Discipline
Scientifiche, Roma, Italia (Agosto 1996).
[Baldazzi97]
C. Baldazzi y A. Paoluzzi. “Dimension-Independent BSP (2):
Boundary to Interior Mapping”. RT-DIA-29-97, Università Degli
Studi di Roma Tre, Dipartimento di Informatica e Automazione,
Roma, Italia (Diciembre 1997).
[Brunet 85]
P. Brunet y I. Navazo. “Geometric Modeling Using Exact Octree
Representation of Polyhedral Objects”. Proc. Eurographics ’85,
pp. 159-169 (Septiembre 1985).
[Cano02]
P. Cano y J.C. Torres. “Representation of Polyhedral Objects
Using SP-Octrees”. WSCG ‘2002, pp. 95-101 (Febrero 2002).
124
[Chen88]
H. Chen y T. Huang. “A Survey of Construction and Manipulation
of Octrees”. Computer Vision, Graphics and Image Processing 43,
pp. 409-431 (1988).
[Comba96]
J. Comba y B. Naylor. “Conversion of Binary Space Partitioning
Trees to Boundary Representation”. Proceedings of Theory and
Practic e of Geometric Modeling, Tuebingen, Germany (Octubre
1996).
[Cornell95]
“Binary Space Partitioning Trees FAQ”. Cornell University
Program of Computer Graphics.
http://www.graphics.cornell.edu/bspfaq/ (Septiembre 1995).
[Damski98]
J.C. Damski y J.S. Gero. “Object Representation and Reasoning
Using Halfspaces and Logic”. Artificial Intelligence in Design ’98,
Kluwer, Dordrecht, pp. 107-126 (1998).
[Dobkin88]
D. Dobkin, L. Guibas, J. Hershberger y J. Snoeyink. “An Efficient
Algorithm for Finding the CSG Representation of a Simple
Polygon”. Computer Graphics 22(4), pp. 31-40 (August 1988).
[Edelsbrunner95] H. Edelsbrunner. “Algebraic Decomposition of Non-convex
Polyhedra”. Proc 36th Ann. IEEE Sypos. Found. Comput. Sci, pp.
248-257 (1995).
[Elber88]
G. Elber y M. Shpitalni. “Octree creation via C.S.G. definition”.
The Visual Computer 4, pp. 53-64 (1988).
[Foley92]
Foley, van Dam, Feiner y Hughes. “Computer Graphics:
Principles and Practice”. USA, pp. 695-697 (1992).
[Franklin1]
R. Franklin. “Point Inclusion in Polyhedron Testing”. ECSE Dept.,
Rensselaer Polytechnic Inst, Troy NY, USA.
[Franklin2]
R. Franklin. “PNPOLY – Point Inclusion in Polygon Test”. ECSE
Dept., Rensselaer Polytechnic Inst, Troy NY, USA.
[Greiner98]
G. Greiner y K. Hormann. “Efficient Clipping of Arbitrary
Polygons”. ACM Transactions on Graphics 17(2), pp. 71-83 (Abril
1998).
[Haines88]
E. Haines. “Standard Procedural Databases”. 3D/Eye, Inc. HewlettPackard
FSD/HP
Laboratories.
Ithaca,
New
York.
[email protected]
125
[Hartquist94]
E.E. Hartquist. “A Practical Implementation of Boundary to CSG
Conversion”. Cornell Programmable Automation, Cornell
University, Ithaca, New York (Agosto 1994).
[Kilgard]
M.J. Kilgard. “OpenGL and X, Part 1: An Introduction”. Silicon
Graphics, Inc.
http://www.sgi.com/software/opengl/glandx/intro/intro.html
[Liang]
S. Liang. “The JavaTM Native Interface Programmer’s Guide and
Specification”.
http://java.sun.com/docs/books/jni/html/titlepage.html
[Maillot92]
P.G. Maillot. “A New, Fast Method For 2D Polygon Clipping:
Analysis and Software Implementation”. ACM Transactions on
Graphics 11(3), pp. 276-290 (Julio 1992).
[Martak]
M. Martak. “Lesson: Full-Screen Exclusive Mode API”. The
JavaT M Tutorial.
http://java.sun.com/docs/books/tutorial/extra/fullscreen/
[Navazo86]
I. Navazo. “Contribució a les Tècniques de Modelat Geomètric
d'Objectes Polièdrics Usant la Codificació amb Arbres Octals”.
Doctoral Thesis, Barcelona (1986).
[Navazo87]
I. Navazo, J. Fontdecaba y P. Brunet. “Extended OctTrees,
between CSG Trees and Boundary Representations”. Eurographics
’87, pp. 239-247 (1987).
[Navazo89]
I. Navazo. “Extended OctTree Representation of General Solids
with Plane Faces: Model Structure and Algorithms”. Comput. &
Graphics 13(1), pp. 5-16 (1989).
[Naylor90]
B. Naylor, J. Amanatides y W. Thibault. “Merging BSP Trees
Yields Polyhedral Set Operations”. Computer Graphics 24(4), pp.
115-124 (Agosto 1990).
[OpenGL97]
Silicon Graphics, Inc. “OpenGL Programming Guide”. The Red
Book. USA (1997). http://ask.ii.uib.no/ebt-bin/nphdweb/dynaweb/SGI_Developer/OpenGL_PG/
[Paterson90]
M.S. Paterson y F.F. Yao. “Optimal Binary Space Partitions for
Orthogonal Objects”. Proceedings of 1 st Symp. On Discrete
Algorithms, pp. 100-106 (Enero 1990).
[RSM02]
M Squared Technologies. “Resource Standard Metrics and Quality
Analysis Tool for C, C++ and Java”.
http://msquaredtechnologies.com/m2rsm/index.html).
126
[Said]
A.I. Said y D. Parker. “Design and Analysis of a New Point- inPolyhedron Algorithm”. Department of Surveying, University of
Newcastle-upon-Tyne, United Kingdom.
[Samet90]
H. Samet. “The design and analysis of spatial data structures”.
USA (1990).
[Schewchuk99]
J. Shewchuk. “Non-convex Polyhedra”. Geometry and Topology
of Grid Generation.
http://www.cs.berkeley.edu/~jrs/meshpapers/edels/L-22.ps
[Shapiro93]
V. Shapiro. “Separation for Boundary to CSG Conversion”. ACM
Transactions on Graphics 12(1), pp. 35-55 (Enero 1993).
[Shapiro97]
V. Shapiro. “Maintenance of Geometric Representations Through
Space Decompositions”. International Journal on Computational
Geometry and Applications 7(4), pp. 383-418 (1997).
[Stearns]
B. Stearns. “Trail: Java Native Interface”. The Java T M Tutorial.
http://java.sun.com/docs/books/tutorial/native1.1/index.html
[Thibault87]
W. Thibault y B. Naylor. “Set Operations on Polyhedra Using
Binary Space Partitioning Trees”. Computer Graphics 21(4), pp.
153-162 (Julio 1987).
[Toussaint85]
G.T. Toussaint. “A Simple Linear Algorithm for Intersecting
Convex Polygons”. The Visual Computer 1, pp. 118-123 (1985).
[Vatti92]
B.R. Vatti. “A generic solution to polygon clipping”.
Communications of the ACM 35(7), pp. 56-63 (Julio 1992).
[Vort01]
“A Very Ordinary Rendering
[email protected]
[Weingartner97]
P.J. Weingartner. “A First Guide to PostScript”. (Abril 1997).
http://www.cs.indiana.edu/docproject/programming/postscript/post
script.html
Tool-Kit”.
Version
2.3.3.