Search results for "Computer Science::Computational Geometry"
showing 10 items of 70 documents
An Approximating-Interpolatory Subdivision Scheme.
2011
International audience; In the last decade, study and construction of quad/triangle subdivision schemes have attracted attention. The quad/triangle subdivision starts with a control mesh consisting of both quads and triangles and produces ner and ner meshes with quads and triangles (Fig. 1). Design- ers often want to model certain regions with quad meshes and others with triangle meshes to get better visual qual- ity of subdivision surfaces. Smoothness analysis tools exist for regular quad/triangle vertices. Moreover C1 and C2 quad/triangle schemes (for regular vertices) have been con- structed. But to our knowledge, there are no quad/triangle schemes that uni es approximating and interpola…
Bézier Solutions of the Wave Equation
2004
We study polynomial solutions in the Bezier form of the wave equation in dimensions one and two. We explicitly determine which control points of the Bezier solution at two different times fix the solution.
Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses
2013
International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…
Gray coding cubic planar maps
2016
International audience; The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps. (C) 2015 Elsevier B.V. All rights reserved.
The SCET_II and factorization
2003
We reformulate the soft-collinear effective theory which includes the collinear quark and soft gluons. The quark form factor is used to prove that SCET$_{\rm II}$ reproduces the IR physics of the full theory. We give a factorization proof in deep inelastic lepton-hadron scattering by use of the position space formulation.
Bezier curves approximation of triangularized surfaces using SVG
2006
This paper presents a technique to convert surfaces, obtained through a Data Dependent Triangulation, in Bezier Curves by using a Scalable Vector Graphics File format. The method starts from a Data Dependent Triangulation, traces a map of the boundaries present into the triangulation, using the characteristics of the triangles, then the estimated barycenters are connected, and a final conversion of the resulting polylines in curves is performed. After the curves have been estimated and closed the final representation is obtained by sorting the surfaces in a decreasing order. The proposed techniques have been compared with other raster to vector conversions in terms of perceptual quality.
Spectrum cartography using adaptive radial basis functions: Experimental validation
2017
In this paper, we experimentally validate the functionality of a developed algorithm for spectrum cartography using adaptive Gaussian radial basis functions (RBF). The RBF are strategically centered around representative centroid locations in a machine learning context. We assume no prior knowledge about neither the power spectral densities (PSD) of the transmitters nor their locations. Instead, the received signal power at each location is estimated as a linear combination of different RBFs. The weights of the RBFs, their Gaussian decaying parameters and locations are jointly optimized using expectation maximization with a least squares loss function and a quadratic regularizer. The perfor…
"Table 126" of "Studies of QCD at e+ e- centre-of-mass energies between 91-GeV and 209-GeV."
2004
Planarity distribution at c.m. energy 133.00 GeV.
"Table 130" of "Studies of QCD at e+ e- centre-of-mass energies between 91-GeV and 209-GeV."
2004
Planarity distribution at c.m. energy 189.00 GeV.
"Table 132" of "Studies of QCD at e+ e- centre-of-mass energies between 91-GeV and 209-GeV."
2004
Planarity distribution at c.m. energy 206.00 GeV.