Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Menelaos I. Karavelas"'
Publikováno v:
Computational Geometry. 46:615-630
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@?"1"= "j"= =3 odd, where n"i spheres have rad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8eca4d971e44378be89e3aba1b120f4
https://doi.org/10.1016/j.comgeo.2013.02.001
https://doi.org/10.1016/j.comgeo.2013.02.001
Publikováno v:
Computational Geometry. 42:522-535
One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5796cd3c70d622a041440f0ce6c16a1
https://doi.org/10.1016/j.comgeo.2008.11.002
https://doi.org/10.1016/j.comgeo.2008.11.002
Publikováno v:
Computational Geometry. 38:111-127
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was influenced by various considerations, including extensibility, support
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0f264d6dc0a1d2186b413d86d3b7e36
https://doi.org/10.1016/j.comgeo.2006.11.006
https://doi.org/10.1016/j.comgeo.2006.11.006
Publikováno v:
Computer-Aided Design. 39:639-651
This paper proposes a framework for constructing G^1 surfaces that interpolate data points on parallel cross sections, consisting of simple disjoined and non-nested contours, the number of which may vary from plane to plane. Using appropriately estim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e09dacf28989597b0f396156db29a64
https://doi.org/10.1016/j.cad.2007.05.004
https://doi.org/10.1016/j.cad.2007.05.004
Publikováno v:
Computational Geometry. 33:18-57
We study the predicates involved in an efficient dynamic algorithm for computing the Apollonius diagram in the plane, also known as the additively weighted Voronoi diagram. We present a complete algorithmic analysis of these predicates, some of which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd4c7d929655d896c3cd281d63b966bc
https://doi.org/10.1016/j.comgeo.2004.02.006
https://doi.org/10.1016/j.comgeo.2004.02.006
Publikováno v:
Computing. 72:117-128
Employing the techniques presented by Nairn, Peters and Lutterkort in [1], sharp bounds are firstly derived for the distance between a planar parametric Bezier curve and a parameterization of its control polygon based on the Greville abscissae. Sever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80cee368c21daee9ba8a34a9c843ab54
https://doi.org/10.1007/s00607-003-0051-1
https://doi.org/10.1007/s00607-003-0051-1
Autor:
Eleni Tzanaki, Menelaos I. Karavelas
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r
Comment: 43 pages; minor changes (mostly
Comment: 43 pages; minor changes (mostly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d9c703484d95b08693f9c509c6e93b0
Autor:
Siome Goldenstein, Leonidas J. Guibas, Dimitris N. Metaxas, Eric Aaron, Ambarish Goswami, Menelaos I. Karavelas
Publikováno v:
Computers & Graphics. 25:983-998
We present a new methodology for agent modeling that is scalable and efficient. It is based on the integration of nonlinear dynamical systems and kinetic data structures. The method consists of three layers, which together model 3D agent steering, cr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab80f32d0e80fade61f56f27a540efad
https://doi.org/10.1016/s0097-8493(01)00153-4
https://doi.org/10.1016/s0097-8493(01)00153-4
Publikováno v:
Numerical Algorithms. 23:217-250
We present a global iterative algorithm for constructing spatial G 2‐continuous interpolating ν‐splines, which preserve the shape of the polygonal line that interpolates the given points. Furthermore, the algorithm can handle data exhibiting two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b6c93710912cf234a0c1c09eaede494
https://doi.org/10.1023/a:1019156202082
https://doi.org/10.1023/a:1019156202082
Publikováno v:
IMA Journal of Numerical Analysis. 17:373-419
In this paper we develop and test a simple automatic algorithm for constructing curvature- and torsion-continuous interpolants in R 3 , which are shape-preserving in a sense that takes into account the convexity, torsion, coplanarity and collinearity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9978ed0c92f768b68280c82a8e6607c0
https://doi.org/10.1093/imanum/17.3.373
https://doi.org/10.1093/imanum/17.3.373