UPEM Master 2 Informatique SIS. Digital Geometry. Topic 3: Discrete straight lines: definition and recognition. Yukiko Kenmochi.
|
|
- Esmond Bond
- 6 years ago
- Views:
Transcription
1 UPEM Master 2 Informatique SIS Digital Geometry Topic 3: Discrete straight lines: definition and recognition Yukiko Kenmochi October 12, 2016 Digital Geometry : Topic 3 1/30
2 Straight lines and their discretizations Straight line Definition (Straight line) A line in the Euclidean space R 2 is defined by where α, β, γ R. L = {(x, y) R 2 : αx + βy + γ = 0} We use a normalization, for example, α 2 + β 2 = 1, α + β = 1, or max( α, β ) = 1. Digital Geometry : Topic 3 2/30
3 Straight lines and their discretizations Discretization of straight line Definition (Discrete line) The discrete line of L in Z 2 is defined by D(L) = {(p, q) Z 2 : 0 αp + βq + γ ω} where ω is called the thickness. The values of γ and ω depend on the model of discretization. Digital Geometry : Topic 3 3/30
4 Straight lines and their discretizations Discretization of straight line Definition (Discrete line) The discrete line of L in Z 2 is defined by D(L) = {(p, q) Z 2 : 0 αp + βq + γ ω} where ω is called the thickness. The values of γ and ω depend on the model of discretization. Grid-intersection: γ = γ + ω 2, ω = max( α, β ). Digital Geometry : Topic 3 3/30
5 Straight lines and their discretizations Discretization of straight line Definition (Discrete line) The discrete line of L in Z 2 is defined by D(L) = {(p, q) Z 2 : 0 αp + βq + γ ω} where ω is called the thickness. The values of γ and ω depend on the model of discretization. Grid-intersection: γ = γ + ω 2, ω = max( α, β ). Super-cover (outer Jordan): γ = γ + ω 2, ω = α + β, Digital Geometry : Topic 3 3/30
6 Straight lines and their discretizations Discretization of straight line Definition (Discrete line) The discrete line of L in Z 2 is defined by D(L) = {(p, q) Z 2 : 0 αp + βq + γ ω} where ω is called the thickness. The values of γ and ω depend on the model of discretization. Grid-intersection: γ = γ + ω 2, ω = max( α, β ). Super-cover (outer Jordan): γ = γ + ω 2, ω = α + β, Gauss (half-plane): Digital Geometry : Topic 3 3/30
7 Straight lines and their discretizations Discretization of straight line Definition (Discrete line) The discrete line of L in Z 2 is defined by D(L) = {(p, q) Z 2 : 0 αp + βq + γ ω} where ω is called the thickness. The values of γ and ω depend on the model of discretization. Grid-intersection: γ = γ + ω 2, ω = max( α, β ). Super-cover (outer Jordan): γ = γ + ω 2, ω = α + β, Gauss (half-plane): γ = γ, ω detemines the m-connectedness of the half-plane border: ω = max( α, β ) 1 for m = 8, ω = α + β 1 for m = 4. Digital Geometry : Topic 3 3/30
8 Properties of discrete lines Freeman code Freeman code Chain code: Digital Geometry : Topic 3 4/30
9 Properties of discrete lines Properties of discrete lines Criteria of Freeman (1974) For discrete lines (by grid-intersection discretization), the Freeman code verifies the following three properties: Freeman code Discrete line : Digital Geometry : Topic 3 5/30
10 Properties of discrete lines Properties of discrete lines Criteria of Freeman (1974) For discrete lines (by grid-intersection discretization), the Freeman code verifies the following three properties: Freeman code Discrete line : Digital Geometry : Topic 3 5/30
11 Properties of discrete lines Properties of discrete lines Criteria of Freeman (1974) For discrete lines (by grid-intersection discretization), the Freeman code verifies the following three properties: 1 the code contains at most two different values; Freeman code Discrete line : Digital Geometry : Topic 3 5/30
12 Properties of discrete lines Properties of discrete lines Criteria of Freeman (1974) For discrete lines (by grid-intersection discretization), the Freeman code verifies the following three properties: 1 the code contains at most two different values; 2 those two values differ at most by one unit (modulo 8) ; Freeman code Discrete line : Digital Geometry : Topic 3 5/30
13 Properties of discrete lines Properties of discrete lines Criteria of Freeman (1974) For discrete lines (by grid-intersection discretization), the Freeman code verifies the following three properties: 1 the code contains at most two different values; 2 those two values differ at most by one unit (modulo 8) ; 3 one of the two values appears isolatedly and its appearances are uniformly spaced in the code. Freeman code Discrete line : Digital Geometry : Topic 3 5/30
14 Properties of discrete lines Properties of discrete lines (cont.) Definition (Chord property (Rosenfeld, 1974)) A set of discrete points X satisfies the chord property if for every pair of points p and q of X and for every point r = (r x, r y ) of the real segment between p and q, there exists a point s = (s x, s y ) of X such that max( s x r x, s y r y ) < 1. Digital Geometry : Topic 3 6/30
15 Properties of discrete lines Properties of discrete lines (cont.) Definition (Chord property (Rosenfeld, 1974)) A set of discrete points X satisfies the chord property if for every pair of points p and q of X and for every point r = (r x, r y ) of the real segment between p and q, there exists a point s = (s x, s y ) of X such that max( s x r x, s y r y ) < 1. It proves that a discrete curve is a discrete line segment if and only if it owns the chord property. Digital Geometry : Topic 3 6/30
16 Properties of discrete lines Properties of discrete lines (cont.) Definition (Chord property (Rosenfeld, 1974)) A set of discrete points X satisfies the chord property if for every pair of points p and q of X and for every point r = (r x, r y ) of the real segment between p and q, there exists a point s = (s x, s y ) of X such that max( s x r x, s y r y ) < 1. It proves that a discrete curve is a discrete line segment if and only if it owns the chord property. It allows to show the two first criteria of Freeman and to deduce a number of properties that specify the third criterion. Digital Geometry : Topic 3 6/30
17 Properties of discrete lines Properties of discrete lines (cont.) Definition (Chord property (Rosenfeld, 1974)) A set of discrete points X satisfies the chord property if for every pair of points p and q of X and for every point r = (r x, r y ) of the real segment between p and q, there exists a point s = (s x, s y ) of X such that max( s x r x, s y r y ) < 1. It proves that a discrete curve is a discrete line segment if and only if it owns the chord property. It allows to show the two first criteria of Freeman and to deduce a number of properties that specify the third criterion. There are a number of algorithms for recognizing a discrete straight line based on this property. Digital Geometry : Topic 3 6/30
18 Discrete line drawing Bresenham line-drawing algorithm Algorithm: drawing a discrete line (Bresenham, 1962) Input: Two discrete points (x 1, y 1 ), (x 2, y 2 ) (s.t. x 2 x 1 y 2 y 1 > 0) Output: Line segment between the two points d x = x 2 x 1, d y = y 2 y 1 ; y = y 1 ; e = 0; for x from x 1 to x 2 do put the pixel (x, y); e = e + dy d x ; if e 1 then y = y + 1; e = e 1; initialization value of initial error Can we avoid fractional numbers (error accumulation)? Digital Geometry : Topic 3 7/30
19 Discrete line drawing Bresenham line-drawing algorithm Algorithm: drawing a discrete line (Bresenham, 1962) Input: Two discrete points (x 1, y 1 ), (x 2, y 2 ) (s.t. x 2 x 1 y 2 y 1 > 0) Output: Line segment between the two points d x = x 2 x 1, d y = y 2 y 1 ; y = y 1 ; e = 0; for x from x 1 to x 2 do put the pixel (x, y); e = e + d y ; if e d x then y = y + 1; e = e d x; initialization value of initial error Can we consider rounding instead of truncation? Digital Geometry : Topic 3 7/30
20 Discrete line drawing Bresenham line-drawing algorithm Algorithm: drawing a discrete line (Bresenham, 1962) Input: Two discrete points (x 1, y 1 ), (x 2, y 2 ) (s.t. x 2 x 1 y 2 y 1 > 0) Output: Line segment between the two points d x = x 2 x 1, d y = y 2 y 1 ; y = y 1 ; e = d x ; for x from x 1 to x 2 do put the pixel (x, y); e = e + 2d y ; if e 2d x then y = y + 1; e = e 2d x; initialization value of initial error All the calculations are realised by using integers. Digital Geometry : Topic 3 7/30
21 Arithmetic lines Arithmetic definition of discrete lines Definition (Arithmetic line) An arithmetic line of parameters (a, b, c) and of arithmetic thickness w is defined as D(a, b, c, w) = {(p, q) Z 2 : 0 ap + bq + c < w} where a, b, c, w Z and gcd(a, b) = 1. The thickness w allows to control the connectedness of the line. Digital Geometry : Topic 3 8/30
22 Arithmetic lines Thickness and connectedness of arithmetic lines Theorem Let D(a, b, c, w) be an arithmetic line, then: Digital Geometry : Topic 3 9/30
23 Arithmetic lines Thickness and connectedness of arithmetic lines Theorem Let D(a, b, c, w) be an arithmetic line, then: 1 if w < max( a, b ), it is not connected; 1 Digital Geometry : Topic 3 9/30
24 Arithmetic lines Thickness and connectedness of arithmetic lines Theorem Let D(a, b, c, w) be an arithmetic line, then: 1 if w < max( a, b ), it is not connected; 2 if w = max( a, b ), it is a 8-curve ; naive line 1 2 Digital Geometry : Topic 3 9/30
25 Arithmetic lines Thickness and connectedness of arithmetic lines Theorem Let D(a, b, c, w) be an arithmetic line, then: 1 if w < max( a, b ), it is not connected; 2 if w = max( a, b ), it is a 8-curve ; naive line 3 if max( a, b ) < w < a + b, it is a -curve (its two successive points are 4-adjacent or strictly 8-adjacent); 1 2 Digital Geometry : Topic 3 9/30
26 Arithmetic lines Thickness and connectedness of arithmetic lines Theorem Let D(a, b, c, w) be an arithmetic line, then: 1 if w < max( a, b ), it is not connected; 2 if w = max( a, b ), it is a 8-curve ; naive line 3 if max( a, b ) < w < a + b, it is a -curve (its two successive points are 4-adjacent or strictly 8-adjacent); 4 if w = a + b, it is a 4-curve; standard line Digital Geometry : Topic 3 9/30
27 Arithmetic lines Thickness and connectedness of arithmetic lines Theorem Let D(a, b, c, w) be an arithmetic line, then: 1 if w < max( a, b ), it is not connected; 2 if w = max( a, b ), it is a 8-curve ; naive line 3 if max( a, b ) < w < a + b, it is a -curve (its two successive points are 4-adjacent or strictly 8-adjacent); 4 if w = a + b, it is a 4-curve; standard line 5 if w > a + b, it is said thick Digital Geometry : Topic 3 9/30
28 Arithmetic lines Remainder and leaning point of arithmetic lines Definition (Remainder) The remainder associated to a point p = (p x, p y ) of D(a, b, c, w) is an integer value defined by R(p) = ap x + bp y + c. Digital Geometry : Topic 3 10/30
29 Arithmetic lines Remainder and leaning point of arithmetic lines Definition (Remainder) The remainder associated to a point p = (p x, p y ) of D(a, b, c, w) is an integer value defined by R(p) = ap x + bp y + c. When the remainder is 0, p is called a lower leaning point. When the remainder is w 1, p is called a upper leaning point. Digital Geometry : Topic 3 10/30
30 Arithmetic lines Remainder and leaning point of arithmetic lines Definition (Remainder) The remainder associated to a point p = (p x, p y ) of D(a, b, c, w) is an integer value defined by R(p) = ap x + bp y + c. When the remainder is 0, p is called a lower leaning point. When the remainder is w 1, p is called a upper leaning point. We can generalize the Bresenham algorithm by using the remainder instead of the error e. Digital Geometry : Topic 3 10/30
31 Arithmetic lines Arithmetic line drawing algorithm Algorithm: drawing an arithmetic (naive) line Input: Two discrete points (x 1, y 1 ), (x 2, y 2 ) and c Output: Line segment between the two points b = x 2 x 1, a = y 2 y 1 ; y = y 1 ; r = ax 1 + by 1 + c; for x from x 1 to x 2 put the pixel (x, y); r = ; if then y = y + 1; r = ; We consider here that x 2 x 1 y 2 y 1 > 0. The value of c is initially chosen such that 0 ax 1 + by 1 + c < b. Digital Geometry : Topic 3 11/30
32 Arithmetic lines Arithmetic line drawing algorithm Algorithm: drawing an arithmetic (naive) line Input: Two discrete points (x 1, y 1 ), (x 2, y 2 ) and c Output: Line segment between the two points b = x 2 x 1, a = y 2 y 1 ; y = y 1 ; r = ax 1 + by 1 + c; for x from x 1 to x 2 put the pixel (x, y); r = r + a; if r b then y = y + 1; r = r b; We consider here that x 2 x 1 y 2 y 1 > 0. The value of c is initially chosen such that 0 ax 1 + by 1 + c < b. Digital Geometry : Topic 3 11/30
33 Discrete line recognition Discrete line recognition Problem (Discrete line recognition) Given a discrete curve X (more generally, a set of discrete points), is there a discrete line such that all the points of X belong to it? Yes or No If yes, what are the parameters of this discrete line? Digital Geometry : Topic 3 12/30
34 Discrete line recognition Discrete line recognition Problem (Discrete line recognition) Given a discrete curve X (more generally, a set of discrete points), is there a discrete line such that all the points of X belong to it? Yes or No If yes, what are the parameters of this discrete line? There are many recognition algorithms with linear complexity. Digital Geometry : Topic 3 12/30
35 Discrete line recognition Discrete line recognition Problem (Discrete line recognition) Given a discrete curve X (more generally, a set of discrete points), is there a discrete line such that all the points of X belong to it? Yes or No If yes, what are the parameters of this discrete line? There are many recognition algorithms with linear complexity. 1 approach of linear programming (Werman et al, 1987): verify the existence of feasible (real) solutions. Digital Geometry : Topic 3 12/30
36 Discrete line recognition Discrete line recognition Problem (Discrete line recognition) Given a discrete curve X (more generally, a set of discrete points), is there a discrete line such that all the points of X belong to it? Yes or No If yes, what are the parameters of this discrete line? There are many recognition algorithms with linear complexity. 1 approach of linear programming (Werman et al, 1987): verify the existence of feasible (real) solutions. 2 linguistic approach (Smeulders, Dorst, 1991): use the linguistic properties of discrete lines. Digital Geometry : Topic 3 12/30
37 Discrete line recognition Discrete line recognition Problem (Discrete line recognition) Given a discrete curve X (more generally, a set of discrete points), is there a discrete line such that all the points of X belong to it? Yes or No If yes, what are the parameters of this discrete line? There are many recognition algorithms with linear complexity. 1 approach of linear programming (Werman et al, 1987): verify the existence of feasible (real) solutions. 2 linguistic approach (Smeulders, Dorst, 1991): use the linguistic properties of discrete lines. 3 approach based on preimage (Lindenbaum, Bruckstein, 1993): use the properties of discrete lines in the dual space, called preimages. Digital Geometry : Topic 3 12/30
38 Discrete line recognition Discrete line recognition Problem (Discrete line recognition) Given a discrete curve X (more generally, a set of discrete points), is there a discrete line such that all the points of X belong to it? Yes or No If yes, what are the parameters of this discrete line? There are many recognition algorithms with linear complexity. 1 approach of linear programming (Werman et al, 1987): verify the existence of feasible (real) solutions. 2 linguistic approach (Smeulders, Dorst, 1991): use the linguistic properties of discrete lines. 3 approach based on preimage (Lindenbaum, Bruckstein, 1993): use the properties of discrete lines in the dual space, called preimages. 4 arithmetic approach (Debled-Rennesson, Reveillès, 1995): verify the existence of integer solutions by using arithmetic properties. Digital Geometry : Topic 3 12/30
39 Discrete line recognition Incremental arithmetic line recognition: initialization Let S be a segment of naive line D(a, b, c) with 0 a < b, q = (xq, yq) be the point of the greatest abscissa of S, l and l be the lower leaning points of minimum and maximum abscissas of S, u and u be the upper leaning points of minimum and maximum abscissas of S. By adding a point p = (xp, yp) connected to S such that xp = xq + 1, we verify if S = S {p} is still a naive line segment. Digital Geometry : Topic 3 13/30
40 Discrete line recognition Incremental arithmetic line recognition: algorithm Theorem (Debled-Rennesson and Reveillès, 1995) We have 1 if 0 r(p) < b, S is a naive line segment D(a, b, c); 1 Digital Geometry : Topic 3 14/30
41 Discrete line recognition Incremental arithmetic line recognition: algorithm Theorem (Debled-Rennesson and Reveillès, 1995) We have 1 if 0 r(p) < b, S is a naive line segment D(a, b, c); 2 if r(p) < 1 or r(p) > b, then S is not a naive line segment; 1 Digital Geometry : Topic 3 14/30
42 Discrete line recognition Incremental arithmetic line recognition: algorithm Theorem (Debled-Rennesson and Reveillès, 1995) We have 1 if 0 r(p) < b, S is a naive line segment D(a, b, c); 2 if r(p) < 1 or r(p) > b, then S is not a naive line segment; 3 if r(p) = 1, then S is a naive line segment D(yp yu, xp xu, axp + byp); 1 Digital Geometry : Topic 3 14/30
43 Discrete line recognition Incremental arithmetic line recognition: algorithm Theorem (Debled-Rennesson and Reveillès, 1995) We have 1 if 0 r(p) < b, S is a naive line segment D(a, b, c); 2 if r(p) < 1 or r(p) > b, then S is not a naive line segment; 3 if r(p) = 1, then S is a naive line segment D(yp yu, xp xu, axp + byp); 4 if r(p) = b, then S is a naive line segment D(yp y l, xp x l, axp + byp + b 1). 1 4 Digital Geometry : Topic 3 14/30
44 Discrete line recognition Farey sequence Definition (Farey sequence (Hardy and Write, 1979)) The Farey sequence F n of order n is the sequence of irreducible fractions between 0 and 1, whose denominators are less than or equal to n, in ascending order. Digital Geometry : Topic 3 15/30
45 Discrete line recognition Farey sequence Definition (Farey sequence (Hardy and Write, 1979)) The Farey sequence F n of order n is the sequence of irreducible fractions between 0 and 1, whose denominators are less than or equal to n, in ascending order. If 0 h k n and gcd(h, k) = 1, then h k is in F n. Digital Geometry : Topic 3 15/30
46 Discrete line recognition Farey sequence Definition (Farey sequence (Hardy and Write, 1979)) The Farey sequence F n of order n is the sequence of irreducible fractions between 0 and 1, whose denominators are less than or equal to n, in ascending order. If 0 h k n and gcd(h, k) = 1, then h k is in F n. Example (F 5 ) 0 1, 1 5, 1 4, 1 3, 2 5, 1 2, 3 5, 2 3, 3 4, 4 5, 1 1 Digital Geometry : Topic 3 15/30
47 Discrete line recognition Structure of the Farey sequence: Stern-Brocot tree Property (Neighborhood) If a b and c d are neighboring in a Farey sequence, with a b < c d, then their difference is equal to 1 bd. Digital Geometry : Topic 3 16/30
48 Discrete line recognition Structure of the Farey sequence: Stern-Brocot tree Property (Neighborhood) If a b and c d are neighboring in a Farey sequence, with a b < c d, then their difference is equal to 1 bd. Property (Median) If a b, p q and c d are neighboring in a Farey sequence such that a b < p q < c d, then p q is the median of a b and c d such as p q = a + c b + d. Digital Geometry : Topic 3 16/30
49 Discrete line recognition Structure of the Farey sequence: Stern-Brocot tree Property (Neighborhood) If a b and c d are neighboring in a Farey sequence, with a b < c d, then their difference is equal to 1 bd. Property (Median) If a b, p q and c d are neighboring in a Farey sequence such that a b < p q < c d, then p q is the median of a b and c d such as p q = a + c b + d. These properties allow to construct the Stern-Brocot tree. Digital Geometry : Topic 3 16/30
50 Discrete line recognition Stern-Brocot tree and discrete lines Each vertex h k of the tree corresponds to a pattern (motif) associated to the discrete line of slope h k. Digital Geometry : Topic 3 17/30
51 Discrete line recognition Stern-Brocot tree and discrete lines Each vertex h k of the tree corresponds to a pattern (motif) associated to the discrete line of slope h k. Updating parameters of the incremental discrete line recognition algorithm indicates moving from the tree root to a leaf. (Debled-Rennesson, 1995) Digital Geometry : Topic 3 17/30
52 Discrete line recognition Preimage of a discrete line segment Definition (Preimage of a discrete line segment (Anderson, Kim, 1985)) Given a discrete line segment S, the preimage P(S) is defined as the set of all lines y = sx + t having the same discretization S. Each point (p i, q i ) S, i = 1, 2,..., S, satisfies 0 sp i + q i + t < 1. Thus, P(S) in the parameter space (s, t) is the intersection of 2 S half-planes or S strips of height 1. y t s x Discrete line segment Preimage Digital Geometry : Topic 3 18/30
53 Discrete line recognition Properties of preimages and incremental discrete line recognition Property (Preimage (Dorst, Smeulders, 1984)) Any preimage P(S) forms a convex polygon with at most four vertices in the parameter space. If P(S) has four vertices, then two of them have a common s-coordinate, which is between the s-coordinates of the other two vertices. Property (Preimage (McIlroy, 1984)) The s-coordinates of the vertices of P(S) are successive terms of the Farey sequence of order max(p 0, S p 0 ) where p 0 is the minimal x-coordinate of S. Digital Geometry : Topic 3 19/30
54 Discrete line recognition Properties of preimages and incremental discrete line recognition Property (Preimage (Dorst, Smeulders, 1984)) Any preimage P(S) forms a convex polygon with at most four vertices in the parameter space. If P(S) has four vertices, then two of them have a common s-coordinate, which is between the s-coordinates of the other two vertices. Property (Preimage (McIlroy, 1984)) The s-coordinates of the vertices of P(S) are successive terms of the Farey sequence of order max(p 0, S p 0 ) where p 0 is the minimal x-coordinate of S. These properties allow to improve the incremental algorithm for discrete line recognition with optimal complexity in linear time and constant space. For checking if the set S = S {(p, q)} is a discrete line segment, we verify if P(S ) = P(S) {(s, t) 0 sp + q + t < 1} is not empty. (Lindenbaum, Bruckstein, 1993) Digital Geometry : Topic 3 19/30
55 Discrete line recognition Applications of discrete line recognition The discrete line recognition allow us to: Digital Geometry : Topic 3 20/30
56 Discrete line recognition Applications of discrete line recognition The discrete line recognition allow us to: study the parallelism, colinearity, orthogonality, convexity in the discrete space; Digital Geometry : Topic 3 20/30
57 Discrete line recognition Applications of discrete line recognition The discrete line recognition allow us to: study the parallelism, colinearity, orthogonality, convexity in the discrete space; estimate geometric properties of discrete object borders, such as the length of a curve, tangent and curvature at a point in a curve, etc.; Digital Geometry : Topic 3 20/30
58 Discrete line recognition Applications of discrete line recognition The discrete line recognition allow us to: study the parallelism, colinearity, orthogonality, convexity in the discrete space; estimate geometric properties of discrete object borders, such as the length of a curve, tangent and curvature at a point in a curve, etc.; make a segmentation of a discrete curve into line segments (polygonal approximation). Digital Geometry : Topic 3 20/30
59 Discrete line recognition Applications of discrete line recognition The discrete line recognition allow us to: study the parallelism, colinearity, orthogonality, convexity in the discrete space; estimate geometric properties of discrete object borders, such as the length of a curve, tangent and curvature at a point in a curve, etc.; make a segmentation of a discrete curve into line segments (polygonal approximation). If there is noise in discrete object border, we need to modify the problem. Digital Geometry : Topic 3 20/30
60 Discrete line fitting Discrete line fitting Problem (Discrete line fitting) Given a finite set of discrete points such that S = {p i Z 2 : i = 1, 2,..., N}, we seek the maximum subset of S whose elements are contained by some discrete line D(L). Digital Geometry : Topic 3 21/30
61 Discrete line fitting Discrete line fitting Problem (Discrete line fitting) Given a finite set of discrete points such that S = {p i Z 2 : i = 1, 2,..., N}, we seek the maximum subset of S whose elements are contained by some discrete line D(L). Points p i S are called inliers if p i S D(L); otherwise, they are called outliers. Then, the problem is also described as finding the maximum inlier set in S, called the optimal consensus of discrete line fitting. Digital Geometry : Topic 3 21/30
62 Discrete line fitting Deterministic method for discrete line fitting In the line parameter space, each point p i S corresponds to the strip of height 1. Thus the set of all the strips of S divides the parameter space into regions (as preimages). The problem is to find the region where the maximum number of strips pass. Solution (Kenmochi et al. 2010) By using the topological sweep algorithm (for arrangement of lines), we can visit all the regions with the time complexity O(N 2 ) and the space complexity O(N) where N is the number of points. Digital Geometry : Topic 3 22/30
63 Discrete line fitting Probabilistic method for discrete line fitting (RANSAC) If you know the probability information of data (you know how many outliers are contained approximately), then you can try RANSAC (RANdom Sample Consensus). A solution is obtained with a certain probability; if we increase this probability, we need more iterations, whose number can be fixed by the above probability information of data. RANSAC (Fischler, Bolles, 1981) Iteratively, 1 choose two points, and make a discrete line model from them; 2 count the number of inliers, and compare it to the current best one; 3 if it is better, then replace it as the current best. Alternative robust line fitting: Hough transform Digital Geometry : Topic 3 23/30
64 3D discrete lines 3D straight lines and their discretization Definition (3D straight line) A straight line in the Euclidean space R 3 is defined by L = {(α 1 t + β 1, α 2 t + β 2, α 3 t + β 3 ) R 3 : t R} where α i, β i R for i = 1, 2, 3. Digital Geometry : Topic 3 24/30
65 3D discrete lines 3D straight lines and their discretization Definition (3D straight line) A straight line in the Euclidean space R 3 is defined by L = {(α 1 t + β 1, α 2 t + β 2, α 3 t + β 3 ) R 3 : t R} where α i, β i R for i = 1, 2, 3. The discrete line D(L) defined in Z 3 by the grid intersection is the set of discrete points that are closest to the intersection in the plane of the grid. Digital Geometry : Topic 3 24/30
66 3D discrete lines Discretized line and discrete curve A discretized line is a 26-curve. Definition (m-curve) An m-path π is an m-curve if for every element p i of π, i = 1,..., n, p i has exactly two m-adjacent points in π, except for p 0 and p n that has only one. Digital Geometry : Topic 3 25/30
67 3D discrete lines Discretized line and discrete curve A discretized line is a 26-curve. Theorem (Kim, 1983) A 26-curve is a discrete line if and only if two of its projections on the xy-, yz- and zx-planes are 8-connected 2D discrete lines. Digital Geometry : Topic 3 25/30
68 3D discrete lines Discretized line and discrete curve A discretized line is a 26-curve. Theorem (Kim, 1983) A 26-curve is a discrete line if and only if two of its projections on the xy-, yz- and zx-planes are 8-connected 2D discrete lines. The 3D discrete line recognition is realized by the 2D discrete line recognition (three times). Digital Geometry : Topic 3 25/30
69 3D discrete lines Arithmetic definition of 3D discrete lines Definition (3D arithmetic line) A set G Z 3 is an arithmetic line defined by seven integer parameters a, b, c, d 1, d 2, w 1, and w 2 if and only if G = {(x, y, z) Z 3 : d 1 cx az < d 1 +w 1 d 2 bx ay < d 2 +w 2 }. For simplification, we consider 0 c b a and gcd(a, b, c) = 1. Digital Geometry : Topic 3 26/30
70 3D discrete lines Arithmetic definition of 3D discrete lines Definition (3D arithmetic line) A set G Z 3 is an arithmetic line defined by seven integer parameters a, b, c, d 1, d 2, w 1, and w 2 if and only if G = {(x, y, z) Z 3 : d 1 cx az < d 1 +w 1 d 2 bx ay < d 2 +w 2 }. For simplification, we consider 0 c b a and gcd(a, b, c) = 1. The parameters d 1 and d 2 are called the lower bounds and the parameters w 1 and w 2 define the arithmetic thickness Digital Geometry : Topic 3 26/30
71 3D discrete lines Thickness and connectedness of 3D discrete line The thickness w 1 and w 2 allow to control the connectedness of the line. Theorem (Coeurjolly et al., 2001) Let G be a discrete line defined by a, b, c, d 1, d 2, w 1, w 2 Z where 0 c < b < a, then: Digital Geometry : Topic 3 27/30
72 3D discrete lines Thickness and connectedness of 3D discrete line The thickness w 1 and w 2 allow to control the connectedness of the line. Theorem (Coeurjolly et al., 2001) Let G be a discrete line defined by a, b, c, d 1, d 2, w 1, w 2 Z where 0 c < b < a, then: 1 if a + c w 1 and a + b w 2, G is 6-connected; Digital Geometry : Topic 3 27/30
73 3D discrete lines Thickness and connectedness of 3D discrete line The thickness w 1 and w 2 allow to control the connectedness of the line. Theorem (Coeurjolly et al., 2001) Let G be a discrete line defined by a, b, c, d 1, d 2, w 1, w 2 Z where 0 c < b < a, then: 1 if a + c w 1 and a + b w 2, G is 6-connected; 2 if a + c w 1 and a w 2 < a + b, or if a + b w 2 and a w 1 < a + c, G is 18-connected; Digital Geometry : Topic 3 27/30
74 3D discrete lines Thickness and connectedness of 3D discrete line The thickness w 1 and w 2 allow to control the connectedness of the line. Theorem (Coeurjolly et al., 2001) Let G be a discrete line defined by a, b, c, d 1, d 2, w 1, w 2 Z where 0 c < b < a, then: 1 if a + c w 1 and a + b w 2, G is 6-connected; 2 if a + c w 1 and a w 2 < a + b, or if a + b w 2 and a w 1 < a + c, G is 18-connected; 3 if a w 1 < a + c and a w 2 < a + b, G is 26-connected; Digital Geometry : Topic 3 27/30
75 3D discrete lines Thickness and connectedness of 3D discrete line The thickness w 1 and w 2 allow to control the connectedness of the line. Theorem (Coeurjolly et al., 2001) Let G be a discrete line defined by a, b, c, d 1, d 2, w 1, w 2 Z where 0 c < b < a, then: 1 if a + c w 1 and a + b w 2, G is 6-connected; 2 if a + c w 1 and a w 2 < a + b, or if a + b w 2 and a w 1 < a + c, G is 18-connected; 3 if a w 1 < a + c and a w 2 < a + b, G is 26-connected; 4 if w 1 < a or w 2 < a, G is not connected. Digital Geometry : Topic 3 27/30
76 3D discrete lines Thickness and connectedness of 3D discrete line The thickness w 1 and w 2 allow to control the connectedness of the line. Theorem (Coeurjolly et al., 2001) Let G be a discrete line defined by a, b, c, d 1, d 2, w 1, w 2 Z where 0 c < b < a, then: 1 if a + c w 1 and a + b w 2, G is 6-connected; 2 if a + c w 1 and a w 2 < a + b, or if a + b w 2 and a w 1 < a + c, G is 18-connected; 3 if a w 1 < a + c and a w 2 < a + b, G is 26-connected; 4 if w 1 < a or w 2 < a, G is not connected. G is called a 3D naive line if and only if w 1 = w 2 = max( a, b, c ). Digital Geometry : Topic 3 27/30
77 3D discrete lines 3D naive line Theorem (Coeurjolly et al., 2001) A rational line discretized by the grid intersection is a 3D naive line and vice-versa. Digital Geometry : Topic 3 28/30
78 3D discrete lines 3D naive line Theorem (Coeurjolly et al., 2001) A rational line discretized by the grid intersection is a 3D naive line and vice-versa. According to Theorem (Kim, 1983), we obtain the following corollary: Corollary (Coeurjolly et al., 2001) A 26-curve is a 3D naive line if and only if two of its projections on the xy-, yz- and zx-planes are 2D naives lines. Digital Geometry : Topic 3 28/30
79 3D discrete lines 3D discrete line recognition Problem (3D discrete line recognition) Given a set of 3D discrete points X, do the points of X belong to a 3D discrete line? Yes or No If yes, what are the parameters of this discrete line? Digital Geometry : Topic 3 29/30
80 3D discrete lines 3D discrete line recognition Problem (3D discrete line recognition) Given a set of 3D discrete points X, do the points of X belong to a 3D discrete line? Yes or No If yes, what are the parameters of this discrete line? We apply the incremental algorithm for arithmetic line recognition (for a 2D naive line) (Debled-Rennesson and Reveillès, 1995) to each projection of X on the xy-, yz- and zx-planes. Digital Geometry : Topic 3 29/30
81 3D discrete lines 3D discrete line recognition Problem (3D discrete line recognition) Given a set of 3D discrete points X, do the points of X belong to a 3D discrete line? Yes or No If yes, what are the parameters of this discrete line? We apply the incremental algorithm for arithmetic line recognition (for a 2D naive line) (Debled-Rennesson and Reveillès, 1995) to each projection of X on the xy-, yz- and zx-planes. If Yes for two of its projections, then Yes. Digital Geometry : Topic 3 29/30
82 References References I. Sivignon et I. Debled-Rennesson. Droites et plans discrets, Chapitre 6 dans Géométrie discrète et images numériques, Hermès, R. Klette and A. Rosenfeld. 2D Straightness, Chapter 9 in Digital geometry: geometric methods for digital picture analysis, Morgan Kaufmann, Digital Geometry : Topic 3 30/30
UPEM Master 2 Informatique SIS. Digital Geometry. Topic 2: Digital topology: object boundaries and curves/surfaces. Yukiko Kenmochi.
UPEM Master 2 Informatique SIS Digital Geometry Topic 2: Digital topology: object boundaries and curves/surfaces Yukiko Kenmochi October 5, 2016 Digital Geometry : Topic 2 1/34 Opening Representations
More informationDigital Planar Surface Segmentation Using Local Geometric Patterns
Digital Planar Surface Segmentation Using Local Geometric Patterns Yukiko Kenmochi 1, Lilian Buzer 1, Akihiro Sugimoto 1,2, and Ikuko Shimizu 3 1 Université Paris-Est, LABINFO-IGM, UMR CNRS 8049, A2SI-ESIEE,
More informationAlgorithms for Fast Digital Straight Segments Union
Algorithms for Fast Digital Straight Segments Union Isabelle Sivignon gipsa-lab, CNRS, UMR 5216, F-38420, France isabelle.sivignon@gipsa-lab.grenoble-inp.fr Abstract. Given two Digital Straight Segments
More informationConvexity-preserving rigid motions of 2D digital objects
Convexity-preserving rigid motions of D digital objects Phuc Ngo, Yukiko Kenmochi, Isabelle Debled-Rennesson, Nicolas Passat To cite this version: Phuc Ngo, Yukiko Kenmochi, Isabelle Debled-Rennesson,
More informationOptimal covering of a straight line applied to discrete convexity
Optimal covering of a straight line applied to discrete convexity Jean-Marc Chassery, Isaelle Sivignon gipsa-la, CNRS, UMR 5216, F-38420, France jean-marc.chassery@gipsa-la.grenole-inp.fr isaelle.sivignon@gipsa-la.grenole-inp.fr
More informationMeasure of Straight Lines and its Applications in Digital Geometry
Measure of Straight Lines and its Applications in Digital Geometry David Coeurjolly and Isabelle Sivignon Université de Lyon, CNRS, LIRIS, UMR5205, F-69622, France {david.coeurjolly,isabelle.sivignon}@liris.cnrs.fr
More informationDigital shape analysis with maximal segments
Digital shape analysis with maximal segments Asymptotic linear digital geometry Jacques-Olivier Lachaud Laboratory of Mathematics (LAMA - UMR CNRS 5127) University of Savoie, France Sept. 24, 2010 DGCV
More informationDiscrete Circularity Measure
Discrete Circularity Measure Tristan Roussillon 1, Laure Tougne 1, and Isabelle Sivignon 2 1 Laboratoire LIRIS, Université de Lyon, 5 Av Pierre-Mendès France 69676 Bron {tristan.roussillon, laure.tougne}@liris.cnrs.fr
More informationSUPERCOVER PLANE RASTERIZATION A Rasterization Algorithm for Generating Supercover Plane Inside A Cube
SUPEROVER PLANE RASTERIZATION A Rasterization Algorithm for Generating Supercover Plane Inside A ube T. Petković, S. Lončarić University of Zagreb, Faculty of Electrical Engineering and omputing, Unska
More informationDigital Level Layers for Digital Curve Decomposition and Vectorization
2014/07/01 v0.5 IPOL article class Published in Image Processing On Line on 2014 07 30. Submitted on 2013 02 10, accepted on 2013 05 06. ISSN 2105 1232 c 2014 IPOL & the authors CC BY NC SA This article
More informationMeasure of Straight Lines for Digital Contour Analysis
Measure of Straight Lines for Digital Contour Analysis David Coeurjolly and Isabelle Sivignon Université de Lyon, CNRS, LIRIS, UMR5205, F-69622, France {david.coeurjolly,isabelle.sivignon}@liris.cnrs.fr
More information274 Curves on Surfaces, Lecture 5
274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,
More informationFast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity
Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity Isabelle Sivignon To cite this version: Isabelle Sivignon. Fast recognition of a Digital Straight Line
More informationAn Arithmetical Characterization of the Convex Hull of Digital Straight Segments
An Arithmetical Characterization of the Convex Hull of Digital Straight Segments Tristan Roussillon 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69622, FRANCE tristan.roussillon@liris.cnrs.fr
More information2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
More informationOptimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature Fabien Feschet and Laure Tougne {ffeschet,ltougne}@univ-lyon2.fr Laboratoire E.R.I.C. Université Lyon2 5 av. Pierre
More informationRANSAC and some HOUGH transform
RANSAC and some HOUGH transform Thank you for the slides. They come mostly from the following source Dan Huttenlocher Cornell U Matching and Fitting Recognition and matching are closely related to fitting
More informationHinge angles for 3D discrete rotations
Hinge angles for 3D discrete rotations Yohan Thibault, Akihiro Sugimoto, Yukiko Kenmochi Université Paris-Est, LIGM, UMR UPEMLV/ESIEE/CNRS 8049, France National Institute of Informatics, Japan {thibauly,
More information5200/7200 Fall 2007 Concurrence theorems for triangles
5200/7200 Fall 2007 Concurrence theorems for triangles There are two basic concurrence theorems for triangles that hold in neutral geometry, that of medians and of angle bisectors, but it seems hard to
More informationComputational Geometry. Geometry Cross Product Convex Hull Problem Sweep Line Algorithm
GEOMETRY COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming Challenges books. Computational
More informationDecomposing Coverings and the Planar Sensor Cover Problem
Intro. previous work. Restricted Strip Cover Decomposing Multiple Coverings Decomposing Coverings and the Planar Sensor Cover Problem Matt Gibson Kasturi Varadarajan presented by Niv Gafni 2012-12-12 Intro.
More informationCS 664 Image Matching and Robust Fitting. Daniel Huttenlocher
CS 664 Image Matching and Robust Fitting Daniel Huttenlocher Matching and Fitting Recognition and matching are closely related to fitting problems Parametric fitting can serve as more restricted domain
More informationNumerical Optimization
Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationLocal non-planarity of three dimensional surfaces for an invertible reconstruction: k-cuspal cells.
Author manuscript, published in "4th International Symposium, ISVC 2008, Las Vegas : United States (2008)" DOI : 10.1007/978-3-540-89639-5_88 Local non-planarity of three dimensional surfaces for an invertible
More informationOptimal Covering of a Straight Line Applied to Discrete Convexity
Optimal Covering of a Straight Line Applied to Discrete Convexity Jean-Marc Chassery and Isaelle Sivignon gipsa-la, CNRS, UMR 5216, F-38420, France {jean-marc.chassery,isaelle.sivignon}@gipsa-la.grenole-inp.fr
More informationDubna 2018: lines on cubic surfaces
Dubna 2018: lines on cubic surfaces Ivan Cheltsov 20th July 2018 Lecture 1: projective plane Complex plane Definition A line in C 2 is a subset that is given by ax + by + c = 0 for some complex numbers
More informationC3 Numerical methods
Verulam School C3 Numerical methods 138 min 108 marks 1. (a) The diagram shows the curve y =. The region R, shaded in the diagram, is bounded by the curve and by the lines x = 1, x = 5 and y = 0. The region
More informationMa/CS 6b Class 11: Kuratowski and Coloring
Ma/CS 6b Class 11: Kuratowski and Coloring By Adam Sheffer Kuratowski's Theorem Theorem. A graph is planar if and only if it does not have K 5 and K 3,3 as topological minors. We know that if a graph contains
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationOptimal Consensus Set for Digital Line and Plane Fitting
Optimal Consensus Set for Digital Line and Plane Fitting Rita Zrour, 1 Yukiko Kenmochi, 2 Hugues Talbot, 2 Lilian Buzer, 2 Yskandar Hamam, 2,3 Ikuko Shimizu, 4 Akihiro Sugimoto 5 1 Laboratory XLIM, SIC
More informationDigital Straight Line Segment Recognition on Non-Standard Point Lattices
U.U.D.M. Project Report 2010:1 Digital Straight Line Segment Recognition on Non-Standard Point Lattices Kelly Hubble Examensarbete i matematik, 30 hp Handledare: Robin Strand Examinator: Andreas Strömbergsson
More informationThe Cut Locus and the Jordan Curve Theorem
The Cut Locus and the Jordan Curve Theorem Rich Schwartz November 19, 2015 1 Introduction A Jordan curve is a subset of R 2 which is homeomorphic to the circle, S 1. The famous Jordan Curve Theorem says
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )
The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationEuclidean Shortest Paths in Simple Cube Curves at a Glance
Euclidean Shortest Paths in Simple Cube Curves at a Glance Fajie Li and Reinhard Klette Computer Science Department The University of Auckland, New Zealand Abstract. This paper reports about the development
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )
1 The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationLine Arrangement. Chapter 6
Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines
More informationGeometry Definitions and Theorems. Chapter 9. Definitions and Important Terms & Facts
Geometry Definitions and Theorems Chapter 9 Definitions and Important Terms & Facts A circle is the set of points in a plane at a given distance from a given point in that plane. The given point is the
More informationReversible polyhedral reconstruction of discrete surfaces
Reversible polyhedral reconstruction of discrete surfaces Isabelle Sivignon 1, Florent Dupont, and Jean-Marc Chassery 1 1 Laboratoire LIS Domaine universitaire Grenoble - BP46 3840 St Martin d Hères Cedex,
More informationChapter - 2: Geometry and Line Generations
Chapter - 2: Geometry and Line Generations In Computer graphics, various application ranges in different areas like entertainment to scientific image processing. In defining this all application mathematics
More informationComputer Graphics 7 - Rasterisation
Computer Graphics 7 - Rasterisation Tom Thorne Slides courtesy of Taku Komura www.inf.ed.ac.uk/teaching/courses/cg Overview Line rasterisation Polygon rasterisation Mean value coordinates Decomposing polygons
More informationPITSCO Math Individualized Prescriptive Lessons (IPLs)
Orientation Integers 10-10 Orientation I 20-10 Speaking Math Define common math vocabulary. Explore the four basic operations and their solutions. Form equations and expressions. 20-20 Place Value Define
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationSECONDARY DRAFT SYLLABUS. 2. Representation of functions. 3. Types of functions. 4. Composition of functions (two and three)
et et et CLASS IX Topic :Set Language et et 1. Describing and representing sets SECONDARY DRAFT SYLLABUS Able to describe a set in Descriptive, Set- builder and roster forms and through Venn diagram. Use
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationTopology 550A Homework 3, Week 3 (Corrections: February 22, 2012)
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in
More informationTOPICS. Integers Properties of addition and. Rational Numbers Need for rational numbers. Exponents or Powers Introduction to Exponents or
TOPICS DETAILS Integers Properties of addition and subtraction of integers Multiplication of integers Properties of multiplication of integers Division of integers Properties of division of integers Introduction
More informationDigital Geometry Based on the Topology of Abstract Cell Complexes
This is a slightly modernized version of the paper published in the Proceedings of the Colloquium "Discrete Geometry for Computer Imagery", University of Strasbourg, 1993, pp. 259-284. Digital Geometry
More informationAs a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.
II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,
More informationO(n 3 log n) time complexity for the Optimal Consensus Set computation for 4-connected Digital circles
O(n 3 log n) time complexity for the Optimal Consensus Set computation for 4-connected Digital circles Gaelle Largeteau-Skapin, Rita Zrour, and Eric Andres Laboratoire XLIM-SIC UMR CNRS 7252, Université
More informationA Generic and Parallel Algorithm for 2D Image Discrete Contour Reconstruction
A Generic and Parallel Algorithm for 2D Image Discrete Contour Reconstruction Guillaume Damiand, David Coeurjolly To cite this version: Guillaume Damiand, David Coeurjolly. A Generic and Parallel Algorithm
More informationLecture 18 Representation and description I. 2. Boundary descriptors
Lecture 18 Representation and description I 1. Boundary representation 2. Boundary descriptors What is representation What is representation After segmentation, we obtain binary image with interested regions
More informationWeighted Neighborhood Sequences in Non-Standard Three-Dimensional Grids Parameter Optimization
Weighted Neighborhood Sequences in Non-Standard Three-Dimensional Grids Parameter Optimization Robin Strand and Benedek Nagy Centre for Image Analysis, Uppsala University, Box 337, SE-7505 Uppsala, Sweden
More informationFundamental Algorithms of Computer Graphics and the Needs for New Display Materials
152 Original Received November 9, 2009 Accepted for Publication March 25, 2010 2010 Soc. Mater. Eng. Resour. Japan Fundamental Algorithms of Computer Graphics and the Needs for Yong-Kui LIU, Heng-Bo ZHANG
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More information4-Border and 4-Boundary
4-Border and 4-Boundary set S = black and white pixels; set M S = black pixels invalid edges = all edges between M and M = S \ M p M 4-inner pixel iff A 4 (p) M (shown in gray) p M 4-border pixel iff p
More informationEfficiently Updating Feasible Regions for Fitting Discrete Polynomial Curve
Efficiently Updating Feasible Regions for Fitting Discrete Polynomial Curve Fumiki Sekiya 1(B) and Akihiro Sugimoto 2 1 Department of Informatics, SOKENDAI (The Graduate University for Advanced Studies),
More informationDigital straight lines in the Khalimsky plane
Digital straight lines in the Khalimsky plane Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin September 2003 Abstract
More informationCounting Double Tangents of Closed Curves Without Inflection Points
Counting Double Tangents of Closed Curves Without Inflection Points EMILY SUSAN MACWAY UNDERGRADUATE HONORS THESIS FACULTY ADVISOR: ABIGAIL THOMPSON JUNE 2014 UNIVERSITY OF CALIFORNIA, DAVIS COLLEGE OF
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationDRAFT: Mathematical Background for Three-Dimensional Computer Graphics. Jonathan R. Senning Gordon College
DRAFT: Mathematical Background for Three-Dimensional Computer Graphics Jonathan R. Senning Gordon College September 2006 ii Contents Introduction 2 Affine Geometry 3 2. Affine Space...................................
More informationADDITION LAW ON ELLIPTIC CURVES
ADDITION LAW ON ELLIPTIC CURVES JORDAN HISEL Abstract. This paper will explore projective spaces and elliptic curves. Addition on elliptic curves is rather unintuitive, but with a rigorous definition,
More informationPunctured Torus Groups
Punctured Torus Groups Talk by Yair Minsky August, 7 One of the simplest classes of examples of Kleinian surface groups is given by punctured torus groups. We define a punctured torus group to be a discrete
More informationSurface Area Estimation of Digitized Planes Using Weighted Local Configurations
Surface Area Estimation of Digitized Planes Using Weighted Local Configurations Joakim Lindblad Centre for Image Analysis, Uppsala University Lägerhyddsv. 3, SE 75237 Uppsala, Sweden joakim@cb.uu.se Abstract.
More informationEuclidean farthest-point Voronoi diagram of a digital edge
Euclidean farthest-point Voronoi diagram of a digital edge Tristan Roussillon To cite this version: Tristan Roussillon. Euclidean farthest-point Voronoi diagram of a digital edge. Discrete Applied Mathematics,
More informationLocally convex topological vector spaces
Chapter 4 Locally convex topological vector spaces 4.1 Definition by neighbourhoods Let us start this section by briefly recalling some basic properties of convex subsets of a vector space over K (where
More informationHow many colors are needed to color a map?
How many colors are needed to color a map? Is 4 always enough? Two relevant concepts How many colors do we need to color a map so neighboring countries get different colors? Simplifying assumption (not
More informationEECS490: Digital Image Processing. Lecture #23
Lecture #23 Motion segmentation & motion tracking Boundary tracking Chain codes Minimum perimeter polygons Signatures Motion Segmentation P k Accumulative Difference Image Positive ADI Negative ADI (ADI)
More informationComputer Graphics. - Rasterization - Philipp Slusallek
Computer Graphics - Rasterization - Philipp Slusallek Rasterization Definition Given some geometry (point, 2D line, circle, triangle, polygon, ), specify which pixels of a raster display each primitive
More informationFuzzy Voronoi Diagram
Fuzzy Voronoi Diagram Mohammadreza Jooyandeh and Ali Mohades Khorasani Mathematics and Computer Science, Amirkabir University of Technology, Hafez Ave., Tehran, Iran mohammadreza@jooyandeh.info,mohades@aut.ac.ir
More informationTHE DNA INEQUALITY POWER ROUND
THE DNA INEQUALITY POWER ROUND Instructions Write/draw all solutions neatly, with at most one question per page, clearly numbered. Turn in the solutions in numerical order, with your team name at the upper
More informationCS 543: Computer Graphics. Rasterization
CS 543: Computer Graphics Rasterization Robert W. Lindeman Associate Professor Interactive Media & Game Development Department of Computer Science Worcester Polytechnic Institute gogo@wpi.edu (with lots
More informationOn a fast discrete straight line segment detection
On a fast discrete straight line segment detection Ali Abdallah, Roberto Cardarelli, Giulio Aielli University of Rome Tor Vergata Abstract Detecting lines is one of the fundamental problems in image processing.
More information2D Image Synthesis. 2D image synthesis. Raster graphics systems. Modeling transformation. Vectorization. u x u y 0. o x o y 1
General scheme of a 2D CG application 2D Image Synthesis Balázs Csébfalvi modeling image synthesis Virtual world model world defined in a 2D plane Department of Control Engineering and Information Technology
More informationX Std. Topic Content Expected Learning Outcomes Mode of Transaction
X Std COMMON SYLLABUS 2009 - MATHEMATICS I. Theory of Sets ii. Properties of operations on sets iii. De Morgan s lawsverification using example Venn diagram iv. Formula for n( AÈBÈ C) v. Functions To revise
More information2 Geometry Solutions
2 Geometry Solutions jacques@ucsd.edu Here is give problems and solutions in increasing order of difficulty. 2.1 Easier problems Problem 1. What is the minimum number of hyperplanar slices to make a d-dimensional
More informationClick the mouse button or press the Space Bar to display the answers.
Click the mouse button or press the Space Bar to display the answers. 7-1 Objectives You will learn to: Find the geometric mean between two numbers. Solve problems involving relationships between parts
More information2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of
More informationA Model to Evaluate Ray Tracing Hierarchies
A Model to Evaluate Ray Tracing Hierarchies K. R. Subramanian Donald Fussell Department of Computer Sciences The University of Texas at Austin 1 Introduction In this article we develop a model to evaluate
More informationDiscrete plane segmentation and estimation from a point cloud using local geometric patterns
Discrete plane segmentation and estimation from a point cloud using local geometric patterns Yukiko Kenmochi, Lilian Buzer, Akihiro Sugimoto, Ikuko Shimizu To cite this version: Yukiko Kenmochi, Lilian
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationAQA GCSE Maths - Higher Self-Assessment Checklist
AQA GCSE Maths - Higher Self-Assessment Checklist Number 1 Use place value when calculating with decimals. 1 Order positive and negative integers and decimals using the symbols =,, , and. 1 Round to
More informationLecture 8 Object Descriptors
Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh
More informationEinführung in Visual Computing
Einführung in Visual Computing 186.822 Rasterization Werner Purgathofer Rasterization in the Rendering Pipeline scene objects in object space transformed vertices in clip space scene in normalized device
More informationCHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system
CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH6 2.1 Warm-Up: See Solved Homework questions 2.2 Cartesian coordinate system Coordinate axes: Two perpendicular lines that intersect at the origin O on each line.
More informationComputational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry
Computational Geometry Algorithm Design (10) Computational Geometry Graduate School of Engineering Takashi Chikayama Algorithms formulated as geometry problems Broad application areas Computer Graphics,
More informationAdvanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012
UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Fall, 2012 Voronoi Diagrams & Delaunay Triangulations O Rourke: Chapter 5 de Berg et al.: Chapters 7,
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationPerformance Level Descriptors. Mathematics
Performance Level Descriptors Grade 3 Well Students rarely, Understand that our number system is based on combinations of 1s, 10s, and 100s (place value, compare, order, decompose, and combine using addition)
More information3D convex hulls. Computational Geometry [csci 3250] Laura Toma Bowdoin College
3D convex hulls Computational Geometry [csci 3250] Laura Toma Bowdoin College Convex Hulls The problem: Given a set P of points, compute their convex hull 2D 3D 2D 3D polygon polyhedron Polyhedron region
More informationarxiv: v1 [cs.cg] 8 Jan 2018
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon Eunjin Oh Hee-Kap Ahn arxiv:1801.02292v1 [cs.cg] 8 Jan 2018 Abstract Given a set of sites in a simple polygon, a geodesic Voronoi diagram
More informationJordan Curves. A curve is a subset of IR 2 of the form
Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints
More informationAlgorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College
Algorithms for GIS Spatial data: Models and representation (part I) Laura Toma Bowdoin College Outline Spatial data in GIS applications Point data Networks Terrains Planar maps and meshes Data structures
More informationYear Nine Scheme of Work. Overview
Year Nine Scheme of Work Overview Unit Topic 1 Angles 2 Manipulating Algebra and Rules of Negatives 3 Place Value and Decimals 4 Sequences 5 Data 6 Fractions 7 Perimeter and Area of Polygons and Circles
More informationGrades 7 & 8 Pre-Algebra/Course 3,
Grades 7 & 8 Pre-Algebra/Course 3, TERM 1 - AUGUST/SEPTEMBER/OCTOBER Algebra Tools Solving Equations Integers Solving Multi-Step Equations and Inequalities TERM 2 NOVEMBER/DECEMBER/JANUARY Functions &
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationComputer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14 Scan Converting Lines, Circles and Ellipses Hello everybody, welcome again
More informationMATHEMATICS SYLLABUS SECONDARY 4th YEAR
European Schools Office of the Secretary-General Pedagogical Development Unit Ref.: 2010-D-581-en-2 Orig.: EN MATHEMATICS SYLLABUS SECONDARY 4th YEAR 4 period/week course APPROVED BY THE JOINT TEACHING
More informationRealizing Planar Graphs as Convex Polytopes. Günter Rote Freie Universität Berlin
Realizing Planar Graphs as Convex Polytopes Günter Rote Freie Universität Berlin General Problem Statement GIVEN: a combinatorial type of 3-dimensional polytope (a 3-connected planar graph) [ + additional
More information