The SCEAS System
| |||||||

## Search the dblp DataBase
Rafael Jesús Segura:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Juan José Jiménez, Rafael Jesús Segura, Francisco R. Feito
**An Optimized Ray-Tracing for Complex Solids.**[Citation Graph (0, 0)][DBLP] WSCG (Posters), 2001, pp:16-19 [Conf] - Juan José Jiménez, Rafael Jesús Segura, Francisco R. Feito
**Efficient Collision Detection between 2D Polygons.**[Citation Graph (0, 0)][DBLP] WSCG, 2004, pp:191-198 [Conf] - Antonio J. Rueda Ruiz, Rafael Jesús Segura, Francisco R. Feito, Juan Ruiz de Miras, Carlos J. Ogáyar
**Voxelization of Solids Using Simplicial Coverings.**[Citation Graph (0, 0)][DBLP] WSCG (Short Papers), 2004, pp:227-234 [Conf] - Rafael Jesús Segura, Francisco R. Feito
**Algorithms to Test Ray-Triangle Intersection. Comparative Study.**[Citation Graph (0, 0)][DBLP] WSCG (Short Papers), 2001, pp:76-81 [Conf] - Rafael Jesús Segura, Francisco R. Feito, Juan Ruiz de Miras
**Non-evaluated Manipulation of Complex CSG Solids.**[Citation Graph (0, 0)][DBLP] WSCG, 2004, pp:403-410 [Conf] - Carlos J. Ogáyar, Rafael Jesús Segura, Francisco R. Feito
**Point in solid strategies.**[Citation Graph (0, 0)][DBLP] Computers & Graphics, 2005, v:29, n:4, pp:616-624 [Journal] - Rafael Jesús Segura, Francisco R. Feito
**An algorithm for determining intersection segment-polygon in 3D.**[Citation Graph (0, 0)][DBLP] Computers & Graphics, 1998, v:22, n:5, pp:587-592 [Journal] - Antonio J. Rueda Ruiz, Rafael Jesús Segura, Francisco R. Feito, Juan Ruiz de Miras
**Rasterizing complex polygons without tessellations.**[Citation Graph (0, 0)][DBLP] Graphical Models, 2004, v:66, n:3, pp:127-132 [Journal] - Carlos J. Ogáyar, Antonio J. Rueda Ruiz, Rafael Jesús Segura, Francisco R. Feito
**Fast and simple hardware accelerated voxelizations using simplicial coverings.**[Citation Graph (0, 0)][DBLP] The Visual Computer, 2007, v:23, n:8, pp:535-543 [Journal] **Localization in an Interactive System.**[Citation Graph (, )][DBLP]**Collision detection between complex polyhedra.**[Citation Graph (, )][DBLP]**Particle Oriented Collision Detection using Simplicial Coverings and Tetra-Trees.**[Citation Graph (, )][DBLP]**Robust and Optimized Algorithms for the Point-in-Polygon Inclusion Test without Pre-processing.**[Citation Graph (, )][DBLP]**A robust segment/triangle intersection algorithm for interference tests. Efficiency study.**[Citation Graph (, )][DBLP]
Search in 0.028secs, Finished in 0.029secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |