Connected component and simple polygon intersection searching

Author(s):  
Pankaj K. Agarwal ◽  
Marc van Kreveld
Algorithmica ◽  
1996 ◽  
Vol 15 (6) ◽  
pp. 626-660 ◽  
Author(s):  
P. K. Agarwal ◽  
M. van Kreveld

1992 ◽  
Vol 02 (04) ◽  
pp. 349-362 ◽  
Author(s):  
COLLETTE COULLARD ◽  
ANNA LUBIW

A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility graph of a simple polygon with the given weights as Euclidean distances?


2021 ◽  
Vol 8 (1) ◽  
pp. 208-222
Author(s):  
Georges Dloussky

Abstract Let S be a compact complex surface in class VII0 + containing a cycle of rational curves C = ∑Dj . Let D = C + A be the maximal connected divisor containing C. If there is another connected component of curves C ′ then C ′ is a cycle of rational curves, A = 0 and S is a Inoue-Hirzebruch surface. If there is only one connected component D then each connected component Ai of A is a chain of rational curves which intersects a curve Dj of the cycle and for each curve Dj of the cycle there at most one chain which meets Dj . In other words, we do not prove the existence of curves other those of the cycle C, but if some other curves exist the maximal divisor looks like the maximal divisor of a Kato surface with perhaps missing curves. The proof of this topological result is an application of Donaldson theorem on trivialization of the intersection form and of deformation theory. We apply this result to show that a twisted logarithmic 1-form has a trivial vanishing divisor.


Sign in / Sign up

Export Citation Format

Share Document