Browsing by Subject "Computational geometry"
Now showing items 1-20 of 73
-
A constraint-based dynamic geometry system
(Elsevier, 2010-02)
Article
Restricted access - publisher's policyDynamic geometry systems are tools for geometric visualization. They allow the user to define geometric elements, establish relationships between them and explore the dynamic behavior of the remaining geometric elements ... -
A new lower bound on the maximum number of plane graphs using production matrices
(2018)
Conference lecture
Restricted access - publisher's policyWe use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer ... -
A parametric-space-based scan-line algorithm for rendering of bicubic surfaces
(1987)
Article
Open AccessA novel scan-line algorithm for displaying bicubic surfaces is presented. Patches are decomposed on regions of constant sign of the z component of the normal before the scan process. Most of the computations are done in ... -
Alya: Multiphysics engineering simulation toward exascale
(Elsevier, 2016-05)
Article
Open AccessAlya is a multi-physics simulation code developed at Barcelona Supercomputing Center (BSC). From its inception Alya code is designed using advanced High Performance Computing programming techniques to solve coupled problems ... -
Ampliación al espacio de una aplicación de la integración en el campo complejo para la solución de una cuestión de informática gráfica
(Institut d'Estadística de Catalunya, 1992)
Article
Open AccessEl teorema de los residuos de Cauchy sirve como base para un algoritmo que permite determinar la posición relativa de un punto respecto a una curva cerrada simple. La ampliación de este método al espacio tropieza con la ... -
Analysis and Prediction of Human Motion Trajectories in Urban Environments
(Universitat Politècnica de Catalunya, 2011-09)
Master thesis
Restricted access - author's decisionThe design and development of intelligent service mobile robots that interact with humans in daily living activities or cooperate with persons in specific tasks, requires the design of new tools that allow the understanding ... -
Blocking the k-holes of point sets in the plane
(2015-09)
Article
Open AccessLet P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its ... -
Caminos de desviación mínima local
(U. Zaragoza, 2009)
Conference report
Open AccessUn camino que conecta dos puntos s y t en el plano es de desviación mínima respecto de un conjunto de puntos S si la mayor de las distancias entre un punto del camino y S es la menor posible entre todos los caminos que ... -
Colored Ray configurations
(2014)
Conference report
Open AccessWe study the cyclic sequences induced at in nity by pairwise-disjoint colored rays with apices on a given bal- anced bichromatic point set, where the color of a ray is inherited from the color of its apex. We derive a lower ... -
Combining geometric and appearance priors for pose recovery
(Universitat Politècnica de Catalunya, 2009-09)
Master thesis
Restricted access - author's decisionEstimar la pose (rotació i translació) de la càmera a partir dels punts d'interés de l'escena 3D i punts de la imatge 2D és un problema ben resolt en el cas que es coneguin les correspondències entre ells. No obstant, quan ... -
Computing a visibility polygon using few variables
(2014-10-01)
Article
Restricted access - publisher's policyWe present several algorithms for computing the visibility polygon of a simple polygon P of n vertices (out of which r are reflex) from a viewpoint inside P, when P resides in read-only memory and only few working variables ... -
Computing correlation between piecewise-linear functions
(2013)
Article
Restricted access - publisher's policyWe study the problem of computing correlation between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in three dimensions---polyhedral terrains---can be transformed ... -
Computing maximal tiles and application to impostor-based simplification
(North Holland, 2004-08)
Article
Restricted access - publisher's policyThe computation of the largest planar region approximating a 3D object is an important problem with wide applications in modeling and rendering. Given a voxelization of the 3D object, we propose an efficient algorithm to ... -
Configurations of non-crossing rays and related problems
(2016-04)
Article
Open AccessLet S be a set of n points in the plane and let R be a set of n pairwise non-crossing rays, each with an apex at a different point of S. Two sets of non-crossing rays R1R1 and R2R2 are considered to be different if the ... -
Data-driven tetrahedral mesh subdivision
(North Holland, 2007-12)
Article
Restricted access - publisher's policyGiven a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitrary locations. An advantage of the method ... -
Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity
(2014-07-01)
Article
Restricted access - publisher's policyIn geometric constraint solving, Decomposition Recombination solvers (DR-solvers) refer to a general solving approach where the problem is divided into a set of sub-problems, each sub-problem is recursively divided until ... -
Defining a stretching and alignment aware quality measure for linear and curved 2D meshes
(Barcelona Supercomputing Center, 2019-05-07)
Conference report
Open AccessWe define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching ... -
Defining a stretching and alignment aware quality measure for linear and curved 2D meshes
(Springer, 2018)
Conference report
Open AccessWe define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching ... -
Desarrollo de un plugin para programa GIS open source de simplificación de geometrias con restricciones
(Universitat Politècnica de Catalunya, 2014-06-03)
Master thesis (pre-Bologna period)
Open AccessEste trabajo consiste en la creación de un plug-in para QGIS (un editor de geometrías). Consiste en proveer a usuarios de herramientas de simplificación de geometrías con restricciones especiales. En el trabajo se explica ... -
Directional adaptive surface triangulation
(1999-02)
Article
Restricted access - publisher's policySeveral CAD applications require a surface model of the modeled object consisting of a mesh of triangular facets. In this paper, a new algorithm for triangulation of trimmed surfaces is presented. The algorithm generates ...
