Geometric intersection number, bigons and half-bigons
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number
... Received: 11 December 2012 / Revised: 2 August 2013 / Accepted: 6 August 2013 / Published online: 29 August 2013 © The Author(s) 2013. This article is published with open access at Springerlink.com Abstract Several ...
13
Maximum Matchings in Geometric Intersection Graphs
... (geometric intersection) graphs Geometric objects Several of our algorithms work under fairly weak assumptions on the geometric input: we assume that the objects in U have constant description ...
17
Shortest Paths in Geometric Intersection Graphs
... Construct a data structure that supports the following kind of queries for a fixed integer W : given a weight `pz 0 , xq P rW s for each edge pz 0 , xq, where x P X, find the distance to the farthest neighbor of z 0 in H ...
121
Contraction-Bidimensionality of Geometric Intersection Graphs
... 2 Definitions and preliminaries All graphs in this paper are undirected, loop-less, and may have multiple edges. If a graph has no multiple edges, we call it simple. Given a graph G, we denote by V (G) its vertex set and ...
13
Algorithms and Data Structures for Geometric Intersection Query Problems
... I am thankful to Prof. Ravi Janardan for taking me as a graduate student to his lab. More importantly, I would like to thank him for showing a lot of patience over the past six years. I have learnt many invaluable ...
140
Coloring Kk-free intersection graphs of geometric objects in the plane
... m. Then the set V 0 := D ∪ V 0 0 , which has cardinality at most 4 √ m, is a separator for G. 2 We now discuss two constructions which together show that apart from a constant factor of 4, Theorem 3.1 is best possible as ...
17
OpenACC Based GPU Parallelization of Plane Sweep Algorithm for Geometric Intersection
... Polygon intersection using filter and refine approach: As discussed earlier, joining two polygon layers to produce third layer as output requires a filter phase where we find pairs of overlapping polygons from the ...
19
TRAFFIC FLOW ANALYSIS & EFFICIENCY OF GEOMETRIC DESIGN OF A T- INTERSECTION, A CASE STUDY
... 4 Reflectors Optional Present 4.2. Traffic Signals Traffic signals are needed for the control of conflicting streams of vehicular and pedestrian traffic at intersections. There are three signals that direct the traffic ...
12
Humanoid Localization on Robocup Field using Corner Intersection and Geometric Distance Estimation
... the manufacture of mobile phones, compact cameras and robot soccer. In robot soccer, artificial vision processing plays a crucial role in recognizing goal posts, teammates, opponents and balls. Based on prior ...
7
Special Lagrangian torus fibrations of complete intersection Calabi–Yau manifolds: A geometric conjecture
... P U P has Euler characteristic 0, and such that the Euler characteristic of π −1 (U P ) is either 1 or −1, depending on whether P is a positive or negative vertex. The second conjecture, formulated in [33], is more ...
20
EE602 Algorithms GEOMETRIC INTERSECTION CHAPTER 27
... Suitable-pick: pick one line’s endpoint from y-tree with left priority RangeSearch: take a range search in x-tree for intersection. Update: add line to x-tree when encountering the botto[r] ...
26
Geometric Number of Planar Graphs
... A graph G is a planar graph if it is possible to represent it in the plane such that no two edges of the graph intersect except possibly at a vertex to which they are both incident. Any such drawing of planar graph G in ...
7
On the number of genomic pacemakers: a geometric approach
... Abstract The universal pacemaker (UPM) model extends the classical molecular clock (MC) model, by allowing each gene, in addition to its individual intrinsic rate as in the MC, to accelerate or decelerate according to ...
11
Bounds on the chromatic number of intersection graphs of sets in the plane
... Coloring; Intersection graphs; Clique number ...chromatic number ofintersection graphs on the plane was started by Asplund and Gr˝unbaum ...chromatic number ofevery intersection graph ...
7
On the independence number and Hamiltonicity of uniform random intersection graphs
... Random intersection graphs may be used to model several real-life applications characterized by local interactions quite accurately (compared to the G n ,ˆ p model where edges appear independently with probability ...
11
Algorithms. Algorithms GEOMETRIC APPLICATIONS OF BSTS. 1d range search line segment intersection kd trees interval search trees rectangle intersection
... Sweep line reduces 2d orthogonal rectangle intersection search to 1d interval search.. problem example solution[r] ...
53
Radio Geometric Mean Number of Splitting Of Star and Bistar
... radio Geometric Mean Labeling of a connected graph G is a one to one map f from the vertex set V(G) to the set of natural numbers N such that for two distinct vertices u and v of ...
5
Quasi-symmetric 3-designs with a fixed block intersection number
... [email protected] Abstract Quasi-symmetric 3-designs with block intersection numbers x, y (0 ≤ x ≤ y < k) are studied. It is proved that the parameter λ of a quasi-symmetric 3-( v, k, λ) design satisfies a ...
8
Polynomial Selection for the Number Field Sieve in an Elementary Geometric View
... in number field ...use geometric view in the polynomial selection. In geometric view, the coefficients’ interaction on size and the number of real roots are simultaneously considered in ...
17
The Domination Number of On-line Social Networks and Random Geometric Graphs
... 1. Introduction On-line social networks (or OSNs) such as Facebook have emerged as a hot topic within the network science community. Several studies suggest OSNs satisfy many properties in common with other complex ...
14