# US 2012/0044248 A1 · System and method of proximity detection

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0044248 A1
- Document ID: US20120044248A1
- Status: Published application
- Kind: A1
- Application number: 13/282,493
- Filed: 2011-10-27
- Published: 2012-02-23
- Earliest claimed: 2005-10-04
- Assignees: Rdv Systems Ltd.
- Inventors: Nathan ELSBERG; Alex HAZANOV
- Web page: https://patentgrep.com/patent/US20120044248A1

## CPC

- G06F 30/13: Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer implemented method of visualizing an infrastructure comprising: acquiring a cross section definition, the definition comprising points defining a link and link information, each of the points exhibiting a type; creating at least one three dimensional face linking points of a same type; assigning a face rendering for each of the created at least one three dimensional faces with a material definitional associated with the link information; and displaying the faces with the rendering. The invention also provides for a computing system operable to: acquire a cross section definition, the definition comprising points defining a link and link information, each of the points exhibiting a type; create at least one three dimensional face linking points of a same type; and assign a face rendering for each of the created at least one three dimensional faces with a material definitional associated with the link information.

## Claims

### Claim 1

A computer implemented method of proximity detection comprising:
defining a set of three dimensional entities in a screen-graph for analysis;
for each entity in said defined set, creating a bounding box;
setting said created bounding box to a first predetermined value;
for each of said set created bounding boxes, performing an intersection test with at least one other bounding box;
in the event that an intersection is found by said performed intersection test, for each face of each entity in the intersection enlarging the face by a second predetermined value;
for each of said enlarged faces, performing an intersection test with each of said other enlarged faces; and
in the event that an intersection is found by said performed intersection test of said enlarged faces, marking a collision.

### Claim 2 (depends on 1)

The computer implemented method according to claim 1, wherein said first and second predetermined values are each a proximity value determining a collision.

### Claim 3 (depends on 1)

The computer implemented method according to claim 1, wherein said first predetermined value is substantially the same as said second predetermined value.

### Claim 4 (depends on 3)

The computer implemented method according to claim 3, wherein said first and second predetermined values are each a proximity value determining a collision.

### Claim 5

A computing system for visually displaying proximity detection, comprising a computer and a monitor, the computer being arranged to:
define a set of three dimensional entities in a screen-graph for analysis;
for each entity in said defined set, create a bounding box;
set said created bounding box to a first predetermined value;
for each of said set created bounding boxes, perform an intersection test with at least one other bounding box;
in the event that an intersection is found by said performed intersection test, for each face of each entity in the intersection enlarge the face by a second predetermined value;
for each of said enlarged faces, perform an intersection test with each of said other enlarged faces; and
in the event that an intersection is found by said performed intersection test of said enlarged faces, mark a collision by displaying, on the monitor, a collision representing marker overlaying a display of said screen-graph.

### Claim 6 (depends on 5)

The computing system according to claim 5, wherein said collision representing marker comprises a 3 dimensional sphere marker.

### Claim 7 (depends on 5)

The computing system according to claim 5, wherein said first and second predetermined values are each a proximity value determinative of a collision.

### Claim 8 (depends on 5)

The computing system according to claim 5, wherein said first predetermined value is substantially the same as said second predetermined value.

### Claim 9 (depends on 8)

The computing system according to claim 8, wherein said first and second predetermined values are each a proximity value determinative of a collision.

### Claim 10

A non-transitory computer readable medium containing instructions for controlling a data processing system to perform a method of proximity detection, the method comprising:
defining a set of three dimensional entities in a screen-graph for analysis;
for each entity in said defined set, creating a bounding box;
setting said created bounding box to a first predetermined value;
for each of said set created bounding boxes, performing an intersection test with at least one other bounding box;
in the event that an intersection is found by said performed intersection test, for each face of each entity in the intersection enlarging the face by a second predetermined value;
for each of said enlarged faces, performing an intersection test with each of said other enlarged faces; and
in the event that an intersection is found by said performed intersection test of said enlarged faces, marking a collision.

### Claim 11 (depends on 10)

The non-transitory computer readable medium according to claim 10, wherein said first and second predetermined values are each a proximity value determining a collision.

### Claim 12 (depends on 10)

The non-transitory computer readable medium according to claim 10, wherein said first predetermined value is substantially the same as said second predetermined value.

### Claim 13 (depends on 12)

The non-transitory computer readable medium according to claim 12, wherein said first and second predetermined values are each a proximity value determining a collision.