I work on computational geometry. A huge number of two-dimensional and three-dimensional data are found in my project. Coordinates of polygon and polyhedrons vertices consisted of two-dimensional and three-dimensional data, respectively. Indeed, polyhedrons face data are also founded. Storing and retrieving them is nessecesery in some part of my code.

I want to know is there any efficient storing algorithm for my data which:

  1. Require the least time and volume
  2. Shapes can be easily retrieved

Please explain it in the simplest because I am new to this kind of algorithm.

I will appreciate any comments that give me a little help and forgive me for writing shortcomings.

  • 1
    $\begingroup$ Have you looked into any of the existing computational geometry engines such as CGAL or OpenCASCADE or VTK? $\endgroup$ Commented Jan 5, 2021 at 22:09
  • $\begingroup$ What sort of queries are you actually looking to do on the geometric entities? Can you give an example of a use case for this geometric data? And when you talk about storage, are you referring to on disk or in a data structure at runtime of some software? $\endgroup$
    – spektr
    Commented Jan 6, 2021 at 2:50
  • $\begingroup$ @WolfgangBangerth Thanks for your comment. No, I didn't. But plus to algorithm, finding its philosophy is also important to me. $\endgroup$
    – ALIN
    Commented Jan 6, 2021 at 7:27
  • $\begingroup$ @spektr A large category of actions such as calculating area, volume, convex hall, sorting,... Both types, either the volume on disk or data structure. $\endgroup$
    – ALIN
    Commented Jan 6, 2021 at 7:36
  • $\begingroup$ Cross-posted: scicomp.stackexchange.com/q/36607/4274, cs.stackexchange.com/q/134024/755. Please do not post the same question on multiple sites. $\endgroup$
    – D.W.
    Commented Jan 6, 2021 at 19:46


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.