3D Mesh Distance Calculation Using Visible Face Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for calculating the shortest distance between objects in three-dimensional construction models are inefficient due to the large number of unnecessary calculations required, especially for complex meshes, leading to time-consuming processes.
Innovation Solution
Implementing optimization techniques such as the 'Rendered Pixel Method', 'Face Normal Method', and 'Unique Edges Optimization' to reduce the number of faces and distances calculated, focusing only on visible and relevant edges and faces between objects.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional methods calculate distances between all pairs of vertices, edges, and faces of two meshes, then the shortest distance can be determined, but the calculation time and computational resources increase significantly
Solution Approach 1:
The patent segments the comprehensive distance calculation problem into three distinct calculation paths: vertex-to-vertex distances, vertex-to-face distances, and face-to-face distances. By dividing the calculation into these manageable segments and processing them separately, the system efficiently determines the shortest distance without performing all possible pairwise calculations between all geometric elements.
Solution Approach 2:
The patent applies partial action by calculating only the necessary distance components needed to determine the shortest distance between two meshes. Instead of computing all possible distances between every pair of vertices, edges, and faces, the system performs selective calculations along the three defined paths, avoiding excessive computation while ensuring the shortest distance is found.
2Measurement precision
If all pairs of vertices, edges, and faces are considered for distance calculation, then complete accuracy is achieved, but the complexity of the calculation process increases
Solution Approach 1:
The calculation process is segmented into three distinct paths: vertex-to-vertex, vertex-to-face, and face-to-face calculations. Each path handles specific geometric relationships, reducing the overall complexity by breaking down the comprehensive problem into manageable segments with clear calculation procedures.
Solution Approach 2:
Instead of calculating distances from all vertices to all other elements, the patent inverts the approach by organizing calculations around three specific geometric relationships. This inversion simplifies the process by focusing on meaningful geometric interactions rather than exhaustive pairwise comparisons.
3Reliability
If distance calculations are performed between all geometric elements of two meshes, then the shortest distance is guaranteed to be found, but the computational resources required increase
Solution Approach 1:
The patent performs partial calculations by focusing only on the three essential distance paths needed to guarantee finding the shortest distance. By calculating vertex-to-vertex, vertex-to-face, and face-to-face distances selectively rather than all possible combinations, the system maintains reliability while reducing computational resource consumption.
Solution Approach 2:
The computational workload is segmented into three distinct calculation categories, each handling specific geometric relationships. This segmentation allows the system to allocate computational resources efficiently to only the necessary calculations that guarantee finding the shortest distance, avoiding waste on redundant computations.
Data Source
AI summary
A computing system configured to: (1) render, via a graphical user interface (GUI) displayed by a client station, a three-dimensional view of a construction project using a three-dimensional model file that defines a set of meshes representing physical objects of the construction project, wherein each mesh comprises a set of triangular faces, and wherein the GUI includes a measurement tool for obtaining a shortest distance between a first mesh and a second mesh; (2) receive a request to obtain the shortest distance between the first mesh and the second mesh; (3) calculate a set of distances potentially comprising the shortest distance between the first mesh and the second mesh by first reducing one or both of: (i) the number of faces between which distances are calculated and (ii) the number of distances that are calculated; and (4) determine the shortest distance between the first mesh and the second mesh.