Search results for "Graphics"
showing 10 items of 1223 documents
Exact, efficient, and complete arrangement computation for cubic curves
2006
AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…
Generation of Valid Labeled Binary Trees
2003
International audience; Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.
Approximate convex hull of affine iterated function system attractors
2012
International audience; In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In additio…
A Graph Based Algorithm For Intersection Of Subdivision Surfaces
2003
Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the fol…
The λ-Error Order in Multivariate Interpolation
2005
The aim of this article is to introduce and to study a generalization of the error order of interpolation, named λ – error order of interpolation. This generalization makes possible a deeper analysis of the error in the interpolation process. We derived the general form of the λ – error order of interpolation and then we applied it for many choices of the functional λ.
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
2005
The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the number of calls to be served at the vertex. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. In this paper, we first propose an algorithm to multicolor any weighted planar graph with at most $\frac{11}{4}W$ colors, where W denotes the weighted clique number. Next, we present a polynomial time approximation algorithm which garantees at most 2W colors for multicoloring a power square mesh. Fur…
Pharmacological distribution diagrams: a tool for de novo drug design.
1996
Abstract Discriminant analysis applied to SAR studies using topological descriptors allows us to plot frequency distribution diagrams: a function of the number of drugs within an interval of values of discriminant function vs. these values. We make use of these representations, pharmacological distribution diagrams (PDDs), in structurally heterogeneous groups where generally they adopt skewed Gaussian shapes or present several maxima. The maxima afford intervals of discrimianant function in which exists a good expectancy to find new active drugs. A set of β-blockers with contrasted activity has been selected to test the ability of PDDs as a visualizing technique, for the identification of n…
Means of 2D and 3D Shapes and Their Application in Anatomical Atlas Building
2015
This works deals with the concept of mean when applied to 2D or 3D shapes and with its applicability to the construction of digital atlases to be used in digital anatomy. Unlike numerical data, there are several possible definitions of the mean of a shape distribution and procedures for its estimation from a sample of shapes. Most popular definitions are based in the distance function or in the coverage function, each with its strengths and limitations. Closely related to the concept of mean shape is the concept of atlas, here understood as a probability or membership map that tells how likely is that a point belongs to a shape drawn from the shape distribution at hand. We devise a procedur…
Programming languages for data-Intensive HPC applications: A systematic mapping study
2020
This work is a result of activities from COST Action 10406 High -Performance Modelling and Simulation for Big Data Applications (cHiPSet), funded by the European Cooperation in Science and Technology. FCT, Portugal for grants: NOVA LINCS Research Laboratory Ref. UID/ CEC/ 04516/ 2019); INESC-ID Ref. UID/CEC/50021/2019; BioISI Ref. UID/MULTI/04046/2103; LASIGE Research Unit Ref. UID/CEC/00408/ 2019. A major challenge in modelling and simulation is the need to combine expertise in both software technologies and a given scientific domain. When High-Performance Computing (HPC) is required to solve a scientific problem, software development becomes a problematic issue. Considering the complexity…
Metamodel specialization for graphical modeling language support
2016
Most of current modeling languages are based on graphical diagrams. The concrete graphical syntax of these languages typically is defined informally -- by text and diagram examples. Only recently, starting from UML 2.5, a formalism is offered for defining the graphical syntax of UML. This formalism is based on Diagram Definition standard by OMG, where the main emphasis is on enabling diagram interchange between different tools implementing the given language. While this is crucial for standardized languages such as UML, this aspect is not so important for domain specific languages. In this paper an approach is offered for simple direct definition of concrete graphical syntax by means of met…