compgeomlib

Intro

A collection of miscellaneous maths and visualization tools. Computational geometry is not just the algorithms, but ways to visualize geometry - particularly debugging geometry visually. So we write tools to bootstrap us up.

Source

Files

Makefile
convexregionsD2.h
convexregionsD2test.cpp
convexregionsD2test.h
edgeT.h
edgeTtest.cpp
edgeTtest.h
generaterandompoints.h
halfspaceD3display.h
main.cpp
pnlink.h
polytopeD2linked.cpp
polytopeD2linked.h
polytopeD2linkedtest.cpp
polytopeD2linkedtest.h
polytopeD2tess.h
polytopeD2tessdisp01.h
regionD2linked.h
regionD2linkedtest.cpp
regionD2linkedtest.h
regionD2tess.h
regionD2tessdisplay.h
sequencesequal.h
simplexD1indexed.h
simplexD1linked.h
simplexD1linkedtest.cpp
simplexD1linkedtest.h
simplexD2indexed.h
simplexD2linked.cpp
simplexD2linked.h
tessD2disp01.h
tessD2disp02.h
tessD2draw02.h
tessD2misc.h

projcompile.txt
unittestsreport.txt

Doxygen

main.cpp
Makefile
convexregionsD2
convexregionsD2test
edgeT
edgeTtest
generateRandomPointsInCircle
generateRandomPointsInSphere
halfspaceD3display
halfspaceD3displaywinding
pnlink
pnlinkiter
pnlinkiterconst
polytopeD2linked
polytopeD2tess
polytopeD2tessdisp01
polytopesD2linkedtest
regionD2linked
regionD2linkedtest
regionD2tess
regionD2tessdisplaymesh
regionD2tessdisplaypoints
sequencesequal3helper
simplexD1indexed
simplexD1linked
simplexD1linkedtest
simplexD2indexed
simplexD2linked
tessD2disp01
tessD2disp02
tessD2draw02mesh
tessD2draw02multicolor
tessD2draw02points
tessD2draw02simplexindex
tessD2misc

TODO

• Linked polytope construction with half-spaces.
  Build the structure through a list of half-spaces, the first point is the half-space region. This let the structure have a current position, search for the region with the new point and cut that region. Adv. over bsp trees : not contrained to intersecting parent.
• Document the linked polytopeD2 data structure
  wrt linked shapes which should be called linked polytopes. Discuss how this can can be used to generate a graph.
• polytopeD2linked needs a variable length polytope contructor.
• Re document edgeT.
• Look at implementing a graph data structure.
  For example with a vector of uint's, or linked lists.
• Can the stl::vector reserve length be specified at construction time without constructing defaults?
  Else set at say initial size 4. Implement size() for graph, ignoring null links.
• Marching triangles over uniform grid.
  Write the lines out as indexed lines. Calculate and display the normal. Provide functionality where a function can be given.
  Provide a way for the client to pass the data as an array.
  Options to generate or not generate the normal at each point.
• Marching tetrahedrons over uniform grid.
  Write triangles out as indexed triangles. Provide input from client function.
  Provide input from client matrix.
  Options to calculate normal at each point.