Zobrazeno 1 - 10
of 244
pro vyhledávání: '"Michiel Smid"'
Autor:
Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel Smid, Prosenjit Bose, Jean-Lou De Carufel
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
Let $S$ be a set of $n$ points in the plane that is in convex position. For a real number $t>1$, we say that a point $p$ in $S$ is $t$-good if for every point $q$ of $S$, the shortest-path distance between $p$ and $q$ along the boundary of the convex
Externí odkaz:
https://doaj.org/article/b71af93becab430da69cba2da4e9fa81
Autor:
Michiel Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
Let $P$ be a convex polyhedron in $\mathbb{R}^3$. The skeleton of $P$ is the graph whose vertices and edges are the vertices and edges of $P$, respectively. We prove that, if these vertices are on the unit-sphere, the skeleton is a $(0.999 \cdot \pi)
Externí odkaz:
https://doaj.org/article/12639606d8284977b630fa87f893f5e5
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no.2, Iss Graph Theory (2015)
Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? For points in general position we prove the lower bound of ⌊log2$n$⌋$-1$. For some special
Externí odkaz:
https://doaj.org/article/53789fcf38d94762976ad5435a7783d9
Autor:
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel Smid
Publikováno v:
Journal of Computational Geometry, Vol 4, Iss 1 (2013)
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Wit
Externí odkaz:
https://doaj.org/article/df67c8eef48f4528b47467088e7a6a82
Autor:
Paz Carmi, Michiel Smid
Publikováno v:
Journal of Computational Geometry, Vol 3, Iss 1 (2012)
Let S be a set of n points in Rd and let t>1 be a real number. A graph G=(S,E) is called a t-spanner for S, if for any two points p and q in S, the shortest-path distance in G between p andq is at most t|pq|, where |pq| denotes the Euclidean distance
Externí odkaz:
https://doaj.org/article/9d8f5c1eec9d4f7b9ec5b9851c4c7f16
Publikováno v:
Journal of Computational Geometry, Vol 3, Iss 1 (2012)
Let G be a geometric graph whose vertex set S is a set of n points in ℝd. The stretch factor of two distinct points p and q in S is the ratio of their shortest-path distance in G and their Euclidean distance. We consider the problem of approximatin
Externí odkaz:
https://doaj.org/article/5980272888544584952430de55e4e3a1
Publikováno v:
Journal of Computational Geometry, Vol 1, Iss 1 (2010)
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S) of S is defined to be the dual of the Voronoi diagram of S with respect to the convex
Externí odkaz:
https://doaj.org/article/22480fce4d6c45c393fc2b105609151e
Autor:
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
Publikováno v:
Journal of Graph Algorithms and Applications. 27:1-18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3d01c74d95436ff249141cbd346c58b
https://doi.org/10.7155/jgaa.00607
https://doi.org/10.7155/jgaa.00607
Publikováno v:
Discrete Applied Mathematics. 286:51-61
We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query data structures. Relational event graphs generally represent social network datasets, where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac9ac3bbbab832bc10111d68f4eda4e6
https://doi.org/10.1016/j.dam.2019.03.006
https://doi.org/10.1016/j.dam.2019.03.006
Publikováno v:
International Journal of Computational Geometry & Applications. 29:269-287
We study data structures to answer window queries using stochastic input sequences. The first problem is the most likely maximal point in a query window: Let [Formula: see text] be constants, with [Formula: see text]. Let [Formula: see text] be a set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acd05ef443c0290a56ae87255e66a574
https://doi.org/10.1142/s0218195919500092
https://doi.org/10.1142/s0218195919500092