Results 11 to 20 of about 1,058,735 (299)
Journal of Combinatorial Optimization, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, X, Zang, W, Hu, Z
openaire +4 more sources
The Branch-Width of Circular-Arc Graphs [PDF]
, 2006 We prove that the branch-width of circular-arc graphs can be computed in polynomial time.
Mazoit, Frédéric, Frédéric Mazoit
openaire +2 more sources
Partial Characterizations of Circular-Arc Graphs
Electronic Notes in Discrete Mathematics, 2008 Abstract A circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction.
Flavia Bonomo +3 more
openaire +7 more sources
Study of Circular-arc Gears with Circular-arc Tooth Trace
Jixie chuandong, 1995 On the basis of analying the engaging character of the circular-arc gears with circular-arc tooth trace, in this paper, the engaging motion between circular-arc gears with circular-arc tooth trace and its basic rack are studied by using the principle of ...
洪汉玉, 贾毅
doaj +1 more source
Triangulations with Circular Arcs [PDF]
Journal of Graph Algorithms and Applications, 2012 Summary: An important objective in the choice of a triangulation of a given point set is that the smallest angle becomes as large as possible. When triangulation edges are straight line segments, it is known that the Delaunay triangulation is the optimal solution.
Oswin Aichholzer +5 more
openaire +2 more sources
2013 IEEE Pacific Visualization Symposium (PacificVis), 2013 We present a new circular-arc cartogram model in which countries are drawn as polygons with circular arcs instead of straight-line 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 to the corresponding values.
Jan-Hinrich Kämper +2 more
openaire +3 more sources
Counting Circular Arc Intersections [PDF]
SIAM Journal on Computing, 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(n^{{3 / {2 + \epsilon }}} )$, for any $\epsilon > 0$ is presented.
Pankaj K. Agarwal +2 more
openaire +2 more sources
Boxicity of Circular Arc Graphs [PDF]
Graphs and Combinatorics, 2010 A $k$-dimensional box is the cartesian product $R_1 \times R_2 \times ... \times R_k$ where each $R_i$ is a closed interval on the real line. The {\it 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 $k$-dimensional boxes: that is two vertices are ...
Bhowmick, Diptendu, Chandran, Sunil L
openaire +3 more sources
Arithmetization of a Circular Arc [PDF]
, 2009 In this paper, we present an arithmetization of the Euler's integration scheme based on infinitely large integers coming from the nonstandard analysis theory. Using the differential equation that defines circles allows us to draw two families of discrete arc circles using three parameters, the radius, the global scale and the drawing scale.
Aurélie Richard +4 more
openaire +1 more source
Nerve Complexes of Circular Arcs [PDF]
Discrete & Computational Geometry, 2016 We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral
Michal Adamaszek +4 more
openaire +4 more sources