Results 271 to 280 of about 1,058,735 (299)
Some of the next articles are maybe not open access.
Circular‐Arc Bigraphs and Its Subclasses
Journal of Graph Theory, 2012AbstractIn this article, we obtain two new characterizations of circular‐arc bigraphs. One of them is the representation of a circular‐arc bigraph in terms of two two‐clique circular‐arc graphs while another one represents the same as a union of an interval bigraph and a Ferrers bigraph. Finally, we introduce the notions of proper and unit circular‐arc
Asim Basu +3 more
openaire +1 more source
Reconciling Circular and Elliptical Arcs
Journal of Graphics, GPU, and Game Tools, 2010Abstract Most graphics packages allow users to create arcs from both circles and ellipses. Unfortunately, in some packages the elliptical arcs are drawn incorrectly, resulting in distorted arcs that do not begin and end at the specified angles. Based on the hypothesis that this is because the system is drawing elliptical arcs by non-uniformly scaling ...
openaire +2 more sources
Parallel algorithms on circular-arc graphs
Information Processing Letters, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BERTOSSI A. A, MORETTI, SABRINA
openaire +4 more sources
FITTING CIRCULAR ARCS TO MEASURED DATA
International Journal of Shape Modeling, 2002Summary: Algorithms for fitting circular arcs and straight line segments to measured data are presented. Algebraic as well as geometric methods are discussed leading to efficient techniques for arc and line fitting. A thorough empirical analysis reveals that the best circle fit is via algebraic minimization followed by distance minimization, whereas ...
Les A. Piegl, Wayne Tiller
openaire +2 more sources
Independent Sets in Circular-Arc Graphs
Journal of Algorithms, 1995Summary: This paper presents a linear time algorithm for the independent set problem on circular-arc graphs, previous algorithms for this problem have assumed that the input is a set of circular-arcs and solve the problem in \(O (n)\) time. However, the fastest known algorithm for constructing the circular-arc representation from a set of adjacency ...
Wen-Lian Hsu, Jeremy P. Spinrad
openaire +3 more sources
List Homomorphisms and Circular Arc Graphs
Combinatorica, 1999The list homomorphism problem for a graph \(H\) has as input a graph \(G\) and lists \(L(v)\subseteq V(H)\) for the vertices \(v\in V(G)\). The output is a homomorphism \(f:G\to H\) with \(f(v)\in L(v)\) for every \(v\in V(G)\). It is shown that if \(H\) is loopless then this problem is polynomially solvable if \(\overline{H}\) is a circular arc graph ...
Tomás Feder +2 more
openaire +1 more source
An Approximation Algorithm for Circular Arc Colouring
Algorithmica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Optimal circular arc representations
1995We investigate some properties of minimal interval and circular arc representations and give several optimal parallel recognition and construction algorithms. We show that, among other things, given an s × t interval or circular arc representation matrix, deciding if the representation is minimal can be done in O(log s) time with O(st/log s) EREW ...
openaire +2 more sources
Coloring Circular Arcs with Applications.
2000The circular arc coloring problem is the problem of finding a minimal coloring of a set of arcs on a circle so that if two arcs intersect then they are assigned different colors. When a generic set of circular arcs is to be colored, the problem is known to be NP-complete; we consider certain instances of the problem which can be optimally solved in ...
GARGANO, Luisa, RESCIGNO, Adele Anna
openaire +2 more sources
Detection of Circular Arcs in Images
Procedings of the Alvey Vision Conference 1988, 1988Paul L. Rosin, Geoff A. W. West
openaire +2 more sources