Locking of spatial regions of large-scale fully-connected multi-dimensional spatial data for collaborative updating

Patent metadata

Field	Value
Publication number	US-11017594-B2
Application number	US-201916440178-A
Country	US
Kind code	B2
Filing date	Jun 13, 2019
Priority date	May 6, 2019
Publication date	May 25, 2021
Grant date	May 25, 2021

Abstract

In an example embodiment, techniques are provided for locking a region of fully-connected large-scale multi-dimensional spatial data (e.g., a large-scale 3-D mesh) defined by a bounding box. A region is associated with a lock state (e.g., exclusive or sharable). Clients may access the fully-connected large-scale multi-dimensional spatial data based on a comparison of the bounding box of the requested spatial data to the bounding boxes of other client's locks and their lock state.

First claim

What is claimed is:

1. A method for locking multi-dimensional spatial data stored in one or more files, comprising:
receiving, by a process of a software application executing on one or more computing systems, a request from a first client for a region-based lock on a first region of space represented in the multi-dimensional spatial data;
establishing the region-based lock on the first region, wherein the establishing includes marking a boundary in the space immediately surrounding the first region as read-only;
permitting the first client to write to the multi-dimensional spatial data within the first region;
receiving, by the process of the software application, a request from a second client for a region-based lock on a second region of space represented in the multi-dimensional spatial data;
comparing the first region to the second region; and
in response to whether the first region and the second region intersect, either denying the request for the region-based lock on the second region and preventing the second client from writing to the multi-dimensional spatial data within the second region, or granting the request for the region-based lock on the second region and allowing the second client to write to the multi-dimensional spatial data within the second region.

2. The method of claim 1 , wherein the first region is defined by a first bounding box that encompasses data to be written to by the first client and the second region is defined by a second bounding box that encompasses data to be written by the second client.

3. The method of claim 1 , wherein the region-based lock on the first region is an exclusive lock, the region-based lock on the second region is an exclusive or sharable lock, and in response to the first region and the second region intersecting, denying the request for the exclusive or sharable lock on the second region and preventing the second client from writing to the multi-dimensional spatial data within the second region, and in response to the first region and the second region not intersecting, granting the request for the exclusive or sharable lock on the second region and allowing the second client to write to the multi-dimensional spatial data within the second region.

4. The method of claim 1 , wherein the region-based lock on the first region is a sharable lock, the region-based lock on the second region is an exclusive lock, and in response to the first region and the second region intersecting, denying the request for the exclusive lock on the second region and preventing the second client from writing to the multi-dimensional spatial data within the second region, and in response to the first region and the second region not intersecting, granting the request for the exclusive lock on the second region and allowing the second client to write to the multi-dimensional spatial data within the second region.

5. The method of claim 1 , wherein the region-based lock on the first region is a sharable lock, the region-based lock on the second region is a sharable lock, and in response to the first region and the second region intersecting, granting the request for the sharable lock on the second region and allowing the second client to write to the multi-dimensional spatial data within the second region, and in response to the first region and the second region not intersecting, granting the request for the sharable lock on the second region and allowing the second client to write to the multi-dimensional spatial data within the second region.

6. The method of claim 1 , wherein the permitting the first client to write to the multi-dimensional spatial data within the first region further comprises:
performing a check to verify that the region-based lock on the first region has not expired.

7. The method of claim 1 , wherein the multi-dimensional spatial data is a three dimension (3-D) mesh.

8. The method of claim 7 , wherein the software application is a structure from motion (SfM) photogrammetry application that generates the 3-D mesh based on a set of images of the real-world captured by a camera, and the first client and the second client perform retouching, reconstruction, texturing or annotating operations upon the 3-D mesh.

9. A computing device comprising:
a processor; and
a memory coupled to the processor and configured to store a three-dimensional (3-D) mesh and a process of a structure from motion (SfM) photogrammetry application, the process of the SfM photogrammetry application when executed operable to:
receive a request from a first client that is configured to perform retouching, reconstruction, texturing or annotating operations upon the 3-D mesh for a region-based lock on a first region of space of the 3-D mesh,
establish the region-based lock on the first region, wherein the region-based lock on the first region provides that a boundary in the space immediately surrounding the first region is marked as read-only,
permit the first client to write to the 3-D mesh within the first region,
receive a request from a second client that is configured to perform retouching, reconstruction, texturing or annotating operations upon the 3-D mesh for a region-based lock on a second region of space of the 3-D mesh,
compare the first region to the second region, and
in response to whether the first region and the second region intersect, either deny the request for the region-based lock on the second region and prevent the second client from writing to the 3-D mesh within the second region, or grant the request for the region-based lock on the second region and allow the second client to write to the 3-D mesh within the second region.

10. The computing device of claim 9 , wherein the first region is defined by a first bounding box that encompasses data to be written to by the first client and the second region is defined by a second bounding box that encompasses data to be written by the second client.

11. A non-transitory electronic-device readable medium having instructions stored thereon, the instructions when executed by one or more electronic devices operable to:
receive a request from a first client for a region-based lock on a first region of space represented in multi-dimensional spatial data;
establish the region-based lock on the first region, wherein the region-based lock on the first region provides that a boundary in the space immediately surrounding the first region is marked as read-only;
receive a request from a second client for a region-based lock on a second region of space represented in the multi-dimensional spatial data;
compare the first region to the second region; and
in response to whether the first region and the second region intersect, either deny the request for the region-based lock on the second region, or grant the request for the region-based lock on the second region.

12. The non-transitory electronic-device readable medium of claim 11 , wherein the first region is defined by a first bounding box that encompasses data to be written to by the first client and the second region is defined by a second bounding box that encompasses data to be written by the second client.

13. The non-transitory electronic-device readable medium of claim 11 , wherein the region-based lock on the first region is an exclusive lock, the region-based lock on the second region is an exclusive or sharable lock, and the instructions operable to either deny or grant are operable to, in response to the first region and the second region intersecting, deny the request for the exclusive or sharable lock on the second region, and in response to the first region and the second region not intersecting, grant th

Assignees

• Bentley Sys Inc

Inventors

• Godzaridis Elenie
• Robert Luc
• Pons Jean-Philippe
• Nullans Stephane

Classifications

• G06T2219/024

  Multi-user, collaborative environment · CPC title

• G06T7/11

  Region-based segmentation · CPC title

• G06T2210/12

  Bounding box · CPC title

• G06F16/2343 Primary

  Locking methods, e.g. distributed locking or locking implementation details · CPC title

• G06T19/20

  Editing of three-dimensional [3D] images, e.g. changing shapes or colours, aligning objects or positioning parts · CPC title