COMPUTING DEVICE AND BOUNDARY LINE GRAPH CHECKING METHOD

• US 20130136366A1
• Filed: 10/31/2012
• Published: 05/30/2013
• Est. Priority Date: 11/25/2011
• Status: Active Grant

• Current Assignee: Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. (Hon Hai Precision Industry Co., Ltd.), Hon Hai Precision Industry Co., Ltd.
• Original Assignee: Chih-Kuang Chang, Run-Hui Wu, Xin-Yuan Wu
• Inventors: CHANG, CHIH-KUANG, WU, XIN-YUAN, WU, RUN-HUI
• Granted Patent: US 8,855,428 B2
• Time in Patent Office: Days
• US Class Current: 382/199
• CPC Class Codes: G06F 30/18 Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18

Abstract

A method for checking a boundary line graph using a computing device. The computing device adds a segment line between two adjacent endpoints of the boundary line graph, if the two adjacent endpoints are not connected using the segment line. The computing device removes the segment lines of the endpoints corresponding to intersection points, if the number of the intersection points is not equal to the number of the endpoints. The computing device changes label characters of the endpoints to be arranged in a predetermined order, if an order of the label characters of the endpoints is not a predetermined order according to the boundary line vector.

Claims

1. A computing device, comprising:

at least one processor;

a storage system; and

one or more programs stored in the storage system and being executable by the at least one processor, the one or more programs comprising;

an obtaining module obtains a boundary line graph from the storage system, wherein the boundary line graph comprises a plurality of endpoints, and each endpoint is labeled with a label character;

an adding module adds a segment line between two adjacent endpoints of the boundary line graph, if the two adjacent endpoints are not connected using the segment line;

a calculation module calculates the number of intersection points among the segment lines;

a removing module searches for the intersection points which are not the endpoints, removes the segment lines of the endpoints corresponding to the intersection points, if the number of the intersection points is not equal to the number of the endpoints;

the calculation module further calculates a boundary line vector, which is vertical to the boundary line graph; and

a changing module changes label characters of the endpoints to be arranged in a predetermined order, if an order of the label characters of the endpoints is not a predetermined order according to the boundary line vector.

2. The computing device as described in claim 1, wherein the boundary line graph further comprises a formula of each segment line which are generated by the two adjacent endpoints.

3. The computing device as described in claim 1, wherein the label characters of the two adjacent endpoints are consecutive in order.

4. The computing device as described in claim 1, wherein the order of the label characters of the endpoints is a clockwise direction or a counterclockwise direction.

5. The computing device as described in claim 4, wherein the order of the label characters of the endpoints is a clockwise direction upon the condition that the boundary line vector is directed from a displaying device connected to the computing device.

6. The computing device as described in claim 4, wherein the order of the label characters of the endpoints is a counterclockwise direction upon the condition that the boundary line vector is directed into the displaying device connected to the computing device.

7. A computer-implemented boundary line graph checking method being performed by execution of computer readable program code by a processor of a computing device, the method comprising:

(a) obtaining a boundary line graph from a storage system of the computing device, wherein the boundary line graph comprises a plurality of endpoints, and each endpoint is labeled with a label character;

(b) adding a segment line between two adjacent endpoints of the boundary line graph, when the two adjacent endpoints are not connected using the segment line;

(c) calculating the number of intersection points among the segment lines;

(d) searching for the intersection points which are not endpoints and removing the segment lines of the endpoints corresponding to the intersection points, when the number of the intersection points is not equal to the number of the endpoints;

(e) calculating a boundary line vector which is vertical to the boundary line graph; and

(f) changing label characters of the endpoints to be arranged in a predetermined order, when an order of the label characters of the endpoints is not a predetermined order according to the boundary line vector.

8. The method as described in claim 7, wherein the boundary line graph further comprises a formula of each segment line which are generated by the two adjacent endpoints.

9. The method as described in claim 7, wherein the label characters of the two adjacent endpoints are consecutive in order.

10. The method as described in claim 7, wherein step (e) further comprises:

selecting a segment line of two endpoints selected in the boundary graph;

obtaining a midpoint of the selected segment line of the two endpoints;

selecting an inside point inside the boundary line graph, wherein the inside point satisfy the condition that the segment line generated by the inside point and the midpoint is vertical to the selected segment line of the two endpoints;

calculating a first vector of the segment line of the two endpoints and a second vector of the segment line of the inside point and the midpoint; and

multiplying the first vector and the second vector to generate the boundary line vector.

11. The method as described in claim 7, wherein the order of the label characters of the endpoints is a clockwise direction or a counterclockwise direction.

12. The method as described in claim 11, wherein the order of the label characters of the endpoints is a clockwise direction upon the condition that the boundary line vector is directed from a displaying device connected to the computing device.

13. The method as described in claim 11, wherein the order of the label characters of the endpoints is a counterclockwise direction upon the condition that the boundary line vector is directed into the displaying device connected to the computing device.

14. A non-transitory storage medium having stored thereon instructions that, when executed by a processor of a computing device, causes the computing device to perform a boundary line graph checking method, the method comprising:

(a) obtaining a boundary line graph from a storage system of the computing device, wherein the boundary line graph comprises a plurality of endpoints, and each endpoint is labeled with a label character;

(b) adding a segment line between two adjacent endpoints of the boundary line graph, when the two adjacent endpoints are not connected using the segment line;

(c) calculating the number of intersection points among the segment lines;

(d) searching for the intersection points which are not endpoints and removing the segment lines of the endpoints corresponding to the intersection points, when the number of the intersection points is not equal to the number of the endpoints;

(e) calculating a boundary line vector which is vertical to the boundary line graph; and

(f) changing label characters of the endpoints to be arranged in a predetermined order, when an order of the label characters of the endpoints is not a predetermined order according to the boundary line vector.

15. The non-transitory storage medium as described in claim 14, wherein the boundary line graph further comprises a formula of each segment line which are generated by the two adjacent endpoints.

16. The non-transitory storage medium as described in claim 14, wherein the label characters of the two adjacent endpoints are consecutive in order.

17. The non-transitory storage medium as described in claim 14, wherein the method of step (e) further comprises:

selecting a segment line of two endpoints selected in the boundary graph;

obtaining a midpoint of the selected segment line of the two endpoints;

selecting an inside point inside the boundary line graph, wherein the inside point satisfy the condition that the segment line generated by the inside point and the midpoint is vertical to the selected segment line of the two endpoints;

calculating a first vector of the segment line of the two endpoints and a second vector of the segment line of the inside point and the midpoint; and

multiplying the first vector and the second vector to generate the boundary line vector.

18. The non-transitory storage medium as described in claim 14, wherein the order of the label characters of the endpoints is a clockwise direction or a counterclockwise direction.

19. The non-transitory storage medium as described in claim 18, wherein the order of the label characters of the endpoints is a clockwise direction upon the condition that the boundary line vector is directed from a displaying device connected to the computing device.

20. The non-transitory storage medium as described in claim 18, wherein the order of the label characters of the endpoints is a counterclockwise direction upon the condition that the boundary line vector is directed into the displaying device connected to the computing device.