Výsledky vyhledávání - "Voronoi, Polígons de"

Stabbing circles for sets of segments in the plane

Autor: Mercè Claverol, Carlos Seara, Evanthia Papadopoulou, Elena Khramtcova, Maria Saumell

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
LATIN 2016: Theoretical Informatics ISBN: 9783662495285
LATIN
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we consider the variation where the stabbing object is a circle instead of a line. We show that the problem is tightly connected to two cluster Voronoi diagr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fde6472950ca0112295874a1178236d
https://hdl.handle.net/2117/102514

Zobrazit plný text záznamu

Diseño y construcción de un cuadro de bicicleta de carretera mediante impresión 3D aplicando el método Voronoi

Autor: Crespo Cuevas, Victor

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::12d26789066fc9b40fcb7b3cde402e2c
http://hdl.handle.net/2117/96935

Zobrazit plný text záznamu

Proximity graphs inside large weighted graphs

Autor: Bernardo M. Ábrego, Vera Sacristán, Maria Saumell, David Flores-Peñaloza, Ruy Fabila-Monroy, Henk Meijer, Ferran Hurtado, Silvia Fernández-Merchant

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Given a weighted graph G = (V,E) and a subset U of V, we define several graphs with vertex set U in which two vertices are adjacent if they satisfy a specific proximity rule. These rules use the shortest path distance in G and generalize the proximit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c57739616c2b1b276bf207a99719e9d8
https://doi.org/10.1002/net.21464

Zobrazit plný text záznamu

ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS

Autor: Prosenjit Bose, Carlos M. Nicolas, Jesús García, Pedro Ramos, Ferran Hurtado, Manuel Abellanas

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Given a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a graph with vertex set $\emph{P}$ and an edge exists between two points p,q ∊ $\emph{P}$ when there is a circle through $\emph{p}$ and $\emph{q}$ with

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::453ff9b2b5b0228945722d1960ce3774
https://doi.org/10.1142/s0218195909003143

Zobrazit plný text záznamu

Connecting Red Cells in a Bicolour Voronoi Diagram

Autor: Abellanas, Manuel, Bajuelos, Antonio L., Canales, Santiago, Claverol Aguas, Mercè, Hernández, Gregorio, Pereira de Matos, Inés

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper is to calculate the minimum value of the red sites’ weight such that the union of the red Voronoi cells in the weighted V

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a724209043d797749d25231a7e6a2bb5
http://hdl.handle.net/2117/18614

Zobrazit plný text záznamu

Simplified Voronoi diagrams for motion planning of quadratically-solvable Gough-Stewart platforms

Autor: Joan Aranda, Federico Thomas, Rubén Vaca

Publikováno v: Digital.CSIC. Repositorio Institucional del CSIC
instname
Latest Advances in Robot Kinematics ISBN: 9789400746190
ARK
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya

Presentado al 13th International Symposium on Advances in Robot Kinematics (ARK) celebrado en Austria del 24 al 28 de junio de 2012.
The obstacles in Configuration Space of quadratically-solvable Gough-Stewart platforms, due to both kinematic si

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03e216a89c0e515da02c2b2f3ebaf7a8
http://hdl.handle.net/10261/97632

Zobrazit plný text záznamu

Caminos de desviación mínima local

Autor: Abellanas, Manuel, Hernández, Gregorio, Sacristán Adinolfi, Vera

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Un 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 conectan s y t. En este traba

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a8f290ad21639438215fe698da035cdd
https://hdl.handle.net/2117/9788

Zobrazit plný text záznamu

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

Autor: Joan Antoni Sellarès, Marta Fort

Publikováno v: ICCSA Workshops
Recercat. Dipósit de la Recerca de Catalunya
instname
© International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 2008, p. 394-404
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polyg

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a6e090dc495c69f4ee16859b14e730
https://doi.org/10.1109/iccsa.2008.21

Zobrazit plný text záznamu

Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces

Autor: Marta Fort, Joan Antoni Sellarès

Publikováno v: ISVD
© 4th International Symposium on Voronoi Diagrams in Science and Engineering : 2007 : ISVD '07, 2007, p. 74-83
Articles publicats (D-IMA)
DUGiDocs – Universitat de Girona
instname
Recercat. Dipósit de la Recerca de Catalunya

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon ob

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31c7dadf29b4a26c38cf76a588ab5a69
https://doi.org/10.1109/isvd.2007.24

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání