Results 1  10
of
856
Circular Arc Subdivision
, 1994
"... Abstract: A circular arc is converted into a series of straight line segments, by taking advantage of the property that when a circular arc is bisected, each halfarc has a chordal deviation one quarter that of the original arc. ..."
Abstract
 Add to MetaCart
Abstract: A circular arc is converted into a series of straight line segments, by taking advantage of the property that when a circular arc is bisected, each halfarc has a chordal deviation one quarter that of the original arc.
Circulararc cartograms
"... We present a new circulararc cartogram model in which countries are drawn as polygons with circular arcs instead of straightline segments. Given a political map and values associated with each country in the map, a cartogram is a distorted map in which the areas of the countries are proportional ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a new circulararc cartogram model in which countries are drawn as polygons with circular arcs instead of straightline segments. Given a political map and values associated with each country in the map, a cartogram is a distorted map in which the areas of the countries
Counting circular arc intersections
, 1993
"... In this paper efficient algorithms for counting intersections in a collection of circles or circular arcs are presented. An algorithm for counting intersections in a collection of n circles is presented whose running time is O (n3/2+), for any e> 0 is presented. Using this algorithm as a subrou ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
In this paper efficient algorithms for counting intersections in a collection of circles or circular arcs are presented. An algorithm for counting intersections in a collection of n circles is presented whose running time is O (n3/2+), for any e> 0 is presented. Using this algorithm as a
On some subclasses of circular arcgraphs
 DEPARTAMENTO DE COMPUTACIÓN, FCEYN, UNIVERSIDAD DE BUENOS AIRES
, 1999
"... The intersection graph of a family of arcs on a circle is called a circulararc graph. This class of graphs admits some interesting subclasses: proper circulararc graphs, unit circulararc graphs, Helly circulararc graphs and cliqueHelly circulararc graphs. In this paper, all possible intersec ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The intersection graph of a family of arcs on a circle is called a circulararc graph. This class of graphs admits some interesting subclasses: proper circulararc graphs, unit circulararc graphs, Helly circulararc graphs and cliqueHelly circulararc graphs. In this paper, all possible
Boxicity of Circular Arc Graphs
, 2008
"... A kdimensional box is the cartesian product R1 × R2 × · · · × Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of kdimensional boxes: that is t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
: that is two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. Let G be a circular arc graph with maximum degree ∆. We show that if ∆ < n(α−1)
Circular arc structures
, 2011
"... The most important guiding principle in computational methods for freeform architecture is the balance between cost efficiency on the one hand, and adherence to the design intent on the other. Key issues are the simplicity of supporting and connecting elements as well as repetition of costly parts. ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
. This paper proposes socalled circular arc structures as a means to faithfully realize freeform designs without giving up smooth appearance. In contrast to nonsmooth meshes with straight edges where geometric complexity is concentrated in the nodes, we stay with smooth surfaces and rather distribute
Pathwidth of circulararc graphs
 PROCEEDINGS OF WG 2007, LECTURE NOTES IN COMPUTER SCIENCE 4769, 2007
"... The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a wellknown and wellstudied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time. We give in this pap ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
in this paper an O(n²)time algorithm computing the pathwidth of circulararc graphs.
Triangulations with Circular Arcs
"... An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straightline case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straightline case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple
Proper Helly CircularArc Graphs
"... A circulararc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circulararc model, if every arc has the same length then M is a unit circulararc model and if A satisfies the Helly Property then M is a Helly circularar ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
A circulararc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circulararc model, if every arc has the same length then M is a unit circulararc model and if A satisfies the Helly Property then M is a Helly circulararc
Contact Graphs of Circular Arcs
"... Abstract. We study representations of graphs by contacts of circular arcs, CCArepresentations for short, where the vertices are interiordisjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)sparse if every svert ..."
Abstract
 Add to MetaCart
Abstract. We study representations of graphs by contacts of circular arcs, CCArepresentations for short, where the vertices are interiordisjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)sparse if every s
Results 1  10
of
856