Simena Dinas | Universidad Santiago de Cali (original) (raw)
Papers by Simena Dinas
Encyclopedia of Computer Graphics and Games, Dec 31, 2023
Encyclopedia of Computer Graphics and Games, Dec 31, 2023
Springer eBooks, 2018
Collision detection is the process of determining computationally if two or more objects intersec... more Collision detection is the process of determining computationally if two or more objects intersect, the time, and the parts of the objects that are involved in the intersection.
INGENIERÍA Y COMPETITIVIDAD, 1969
En este artículo se propone un modelo para detección de colisiones basado en doble representación... more En este artículo se propone un modelo para detección de colisiones basado en doble representación esféricajerárquica: una representación en esferas exteriores cuyo objetivo es detectar la no intersección y una representaciónen esferas interiores para mejorar el desempeño del detector de colisiones. El algoritmo fue implementado y serealizaron varias pruebas con poliedros convexos así como también se hizo especial énfasis en las colisiones entre lasesferas interiores. El resultado principal es que mientras las esferas exteriores sirven para detectar la ausencia dedetecciones, las esferas interiores son más eficientes para detectar la existencia de colisiones y resultan útiles paraacelerar el proceso de la detección de colisiones. El uso de esferas interiores mejora el desempeño general delalgoritmo porque reduce el número de pruebas de intersección entre las caras de los poliedros.
Delaunay Triangulation has been used in computational geometry and mathematics; it is a net forme... more Delaunay Triangulation has been used in computational geometry and mathematics; it is a net formed by the union of non-overlapping triangles, where there are no points inside the circumcircle of each triangle. It is popular for meshing algorithms; however, in real world some important edges can be ignored to preserve the “Delaunayhood” of the structure. Constrained Delaunay Triangulation is an extension of Delaunay which forces required edges in the Triangulation; moreover, the resulting triangulation is not always a Delaunay Triangulation. Due to the continuously increasing images volume; there are some researches on extracting information from images. An application combining extracted data from images and Constrained Delaunay Triangulation is shown.
2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012
Rev. Avances en Sistemas Informática, 2007
En este articulo se describe la paralelizacion de un esferizador geometrico utilizado en un detec... more En este articulo se describe la paralelizacion de un esferizador geometrico utilizado en un detector jerarquico de colisiones. La paralelizacion se basa en la computacion par alela con la utilizacion de la her r amienta PVM (Parallel Virtual Machine). Se discute la estrategia utilizada junto a la implementacion. Finalmente, se muestran resultados experimentales y se discuten los resultados obtenidos.
Encyclopedia of Computer Graphics and Games
Encyclopedia of Computer Graphics and Games
Collision detection is the process of determining computationally if two or more objects intersec... more Collision detection is the process of determining computationally if two or more objects intersect, the time, and the parts of the objects that are involved in the intersection.
La calibración de cámaras es un problema mal plante ado en el sentido de Hadamard. Una solución a... more La calibración de cámaras es un problema mal plante ado en el sentido de Hadamard. Una solución a este problema es la estimación de la geometría epipolar. La geometría e pipolar está definida matemáticamente en forma precisa. Sin emba rgo, la geometría epipolar se estima con base en un conjunt o de puntos correspondientes, que pueden contener errores. En e st artículo se compraran cuatro algoritmos para estimar la geometr ía epipolar – algoritmo 8 puntos, minimización del error algebrai co, minimización del error geométrico Gold y minimización del error geométrico Sampson. Se usa un modelo de cámaras para generar p untos correspondientes exactos. Se evalúan experimentalme nt los algoritmos sin perturbar y al perturbar con tres modelos de ruido y dos intensidades de ruido. La minimización de error algebraico normalizado produce los mejores resultados experime ntales. Palabras claves —geometría epipolar, matriz fundamental, calibració n de cámaras.
A model for collision detection based on double hierarchical spherical representation is proposed... more A model for collision detection based on double hierarchical spherical representation is proposed in this paper: anouter spherical representation for detecting no-intersections and an inner spherical representation in order to improvethe performance of the collision detector. The algorithm has been implemented. Several tests were conducted withconvex polyhedral and the performance of the algorithm was evaluated in terms of the collision between innerspheres. The experimental results show that outer spheres have been useful to determine lack of intersection, whereasinner spheres are more efficient for detecting existence of intersection and for speeding up the process of detectingcollision. Using inner spheres improve the general performance because it reduces the number of intersection testsbetween the faces of the polyhedral.
A bounding volume is a common method to simplify object representation by using the composition o... more A bounding volume is a common method to simplify object representation by using the composition of geometrical shapes that enclose the object; it encapsulates complex objects by means of simple volumes and it is widely useful in collision detection applications and ray tracing for rendering algorithms. They are popular in computer graphics and computational geometry. Most popular bounding volumes are spheres, Oriented-Bounding Boxes (OBB's), Axis-Aligned Bounding Boxes (AABB's); moreover, the literature review includes ellipsoids, cylinders, sphere packing, sphere shells, k-DOP's, convex hulls, cloud of points, and minimal bounding boxes, among others. A Bounding Volume Hierarchy is usually a tree in which the complete object is represented tighter fitting every level of the hierarchy. Additionally, each bounding volume has a cost associated to construction, update, and interference tests. For instance, spheres are invariant to rotation and translations, then they do not...
Encyclopedia of Computer Graphics and Games
Ingeniería y Competitividad
Avances En Sistemas E Informatica, Jun 10, 2009
Encyclopedia of Computer Graphics and Games, Dec 31, 2023
Encyclopedia of Computer Graphics and Games, Dec 31, 2023
Springer eBooks, 2018
Collision detection is the process of determining computationally if two or more objects intersec... more Collision detection is the process of determining computationally if two or more objects intersect, the time, and the parts of the objects that are involved in the intersection.
INGENIERÍA Y COMPETITIVIDAD, 1969
En este artículo se propone un modelo para detección de colisiones basado en doble representación... more En este artículo se propone un modelo para detección de colisiones basado en doble representación esféricajerárquica: una representación en esferas exteriores cuyo objetivo es detectar la no intersección y una representaciónen esferas interiores para mejorar el desempeño del detector de colisiones. El algoritmo fue implementado y serealizaron varias pruebas con poliedros convexos así como también se hizo especial énfasis en las colisiones entre lasesferas interiores. El resultado principal es que mientras las esferas exteriores sirven para detectar la ausencia dedetecciones, las esferas interiores son más eficientes para detectar la existencia de colisiones y resultan útiles paraacelerar el proceso de la detección de colisiones. El uso de esferas interiores mejora el desempeño general delalgoritmo porque reduce el número de pruebas de intersección entre las caras de los poliedros.
Delaunay Triangulation has been used in computational geometry and mathematics; it is a net forme... more Delaunay Triangulation has been used in computational geometry and mathematics; it is a net formed by the union of non-overlapping triangles, where there are no points inside the circumcircle of each triangle. It is popular for meshing algorithms; however, in real world some important edges can be ignored to preserve the “Delaunayhood” of the structure. Constrained Delaunay Triangulation is an extension of Delaunay which forces required edges in the Triangulation; moreover, the resulting triangulation is not always a Delaunay Triangulation. Due to the continuously increasing images volume; there are some researches on extracting information from images. An application combining extracted data from images and Constrained Delaunay Triangulation is shown.
2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012
Rev. Avances en Sistemas Informática, 2007
En este articulo se describe la paralelizacion de un esferizador geometrico utilizado en un detec... more En este articulo se describe la paralelizacion de un esferizador geometrico utilizado en un detector jerarquico de colisiones. La paralelizacion se basa en la computacion par alela con la utilizacion de la her r amienta PVM (Parallel Virtual Machine). Se discute la estrategia utilizada junto a la implementacion. Finalmente, se muestran resultados experimentales y se discuten los resultados obtenidos.
Encyclopedia of Computer Graphics and Games
Encyclopedia of Computer Graphics and Games
Collision detection is the process of determining computationally if two or more objects intersec... more Collision detection is the process of determining computationally if two or more objects intersect, the time, and the parts of the objects that are involved in the intersection.
La calibración de cámaras es un problema mal plante ado en el sentido de Hadamard. Una solución a... more La calibración de cámaras es un problema mal plante ado en el sentido de Hadamard. Una solución a este problema es la estimación de la geometría epipolar. La geometría e pipolar está definida matemáticamente en forma precisa. Sin emba rgo, la geometría epipolar se estima con base en un conjunt o de puntos correspondientes, que pueden contener errores. En e st artículo se compraran cuatro algoritmos para estimar la geometr ía epipolar – algoritmo 8 puntos, minimización del error algebrai co, minimización del error geométrico Gold y minimización del error geométrico Sampson. Se usa un modelo de cámaras para generar p untos correspondientes exactos. Se evalúan experimentalme nt los algoritmos sin perturbar y al perturbar con tres modelos de ruido y dos intensidades de ruido. La minimización de error algebraico normalizado produce los mejores resultados experime ntales. Palabras claves —geometría epipolar, matriz fundamental, calibració n de cámaras.
A model for collision detection based on double hierarchical spherical representation is proposed... more A model for collision detection based on double hierarchical spherical representation is proposed in this paper: anouter spherical representation for detecting no-intersections and an inner spherical representation in order to improvethe performance of the collision detector. The algorithm has been implemented. Several tests were conducted withconvex polyhedral and the performance of the algorithm was evaluated in terms of the collision between innerspheres. The experimental results show that outer spheres have been useful to determine lack of intersection, whereasinner spheres are more efficient for detecting existence of intersection and for speeding up the process of detectingcollision. Using inner spheres improve the general performance because it reduces the number of intersection testsbetween the faces of the polyhedral.
A bounding volume is a common method to simplify object representation by using the composition o... more A bounding volume is a common method to simplify object representation by using the composition of geometrical shapes that enclose the object; it encapsulates complex objects by means of simple volumes and it is widely useful in collision detection applications and ray tracing for rendering algorithms. They are popular in computer graphics and computational geometry. Most popular bounding volumes are spheres, Oriented-Bounding Boxes (OBB's), Axis-Aligned Bounding Boxes (AABB's); moreover, the literature review includes ellipsoids, cylinders, sphere packing, sphere shells, k-DOP's, convex hulls, cloud of points, and minimal bounding boxes, among others. A Bounding Volume Hierarchy is usually a tree in which the complete object is represented tighter fitting every level of the hierarchy. Additionally, each bounding volume has a cost associated to construction, update, and interference tests. For instance, spheres are invariant to rotation and translations, then they do not...
Encyclopedia of Computer Graphics and Games
Ingeniería y Competitividad
Avances En Sistemas E Informatica, Jun 10, 2009