[
{
"path": ".editorconfig",
"content": "[*.cs]\n\n# CS1591: Missing XML comment for publicly visible type or member\ndotnet_diagnostic.CS1591.severity = none\n"
},
{
"path": ".gitattributes",
"content": "###############################################################################\n# Set default behavior to automatically normalize line endings.\n###############################################################################\n* text=auto\n\n###############################################################################\n# Set default behavior for command prompt diff.\n#\n# This is need for earlier builds of msysgit that does not have it on by\n# default for csharp files.\n# Note: This is only used by command line\n###############################################################################\n#*.cs diff=csharp\n\n###############################################################################\n# Set the merge driver for project and solution files\n#\n# Merging from the command prompt will add diff markers to the files if there\n# are conflicts (Merging from VS is not affected by the settings below, in VS\n# the diff markers are never inserted). Diff markers may cause the following \n# file extensions to fail to load in VS. An alternative would be to treat\n# these files as binary and thus will always conflict and require user\n# intervention with every merge. To do so, just uncomment the entries below\n###############################################################################\n#*.sln merge=binary\n#*.csproj merge=binary\n#*.vbproj merge=binary\n#*.vcxproj merge=binary\n#*.vcproj merge=binary\n#*.dbproj merge=binary\n#*.fsproj merge=binary\n#*.lsproj merge=binary\n#*.wixproj merge=binary\n#*.modelproj merge=binary\n#*.sqlproj merge=binary\n#*.wwaproj merge=binary\n\n###############################################################################\n# behavior for image files\n#\n# image files are treated as binary by default.\n###############################################################################\n#*.jpg binary\n#*.png binary\n#*.gif binary\n\n###############################################################################\n# diff behavior for common document formats\n# \n# Convert binary document formats to text before diffing them. This feature\n# is only available from the command line. Turn it on by uncommenting the \n# entries below.\n###############################################################################\n#*.doc diff=astextplain\n#*.DOC diff=astextplain\n#*.docx diff=astextplain\n#*.DOCX diff=astextplain\n#*.dot diff=astextplain\n#*.DOT diff=astextplain\n#*.pdf diff=astextplain\n#*.PDF diff=astextplain\n#*.rtf diff=astextplain\n#*.RTF diff=astextplain\n"
},
{
"path": ".gitignore",
"content": "## Ignore Visual Studio temporary files, build results, and\n## files generated by popular Visual Studio add-ons.\n##\n## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore\n\n# User-specific files\n*.rsuser\n*.suo\n*.user\n*.userosscache\n*.sln.docstates\n\n# User-specific files (MonoDevelop/Xamarin Studio)\n*.userprefs\n\n# Mono auto generated files\nmono_crash.*\n\n# Build results\n[Dd]ebug/\n[Dd]ebugPublic/\n[Rr]elease/\n[Rr]eleases/\nx64/\nx86/\n[Ww][Ii][Nn]32/\n[Aa][Rr][Mm]/\n[Aa][Rr][Mm]64/\nbld/\n[Bb]in/\n[Oo]bj/\n[Oo]ut/\n[Ll]og/\n[Ll]ogs/\n\n# Visual Studio 2015/2017 cache/options directory\n.vs/\n# Uncomment if you have tasks that create the project's static files in wwwroot\n#wwwroot/\n\n# Visual Studio 2017 auto generated files\nGenerated\\ Files/\n\n# MSTest test Results\n[Tt]est[Rr]esult*/\n[Bb]uild[Ll]og.*\n\n# NUnit\n*.VisualState.xml\nTestResult.xml\nnunit-*.xml\n\n# Build Results of an ATL Project\n[Dd]ebugPS/\n[Rr]eleasePS/\ndlldata.c\n\n# Benchmark Results\nBenchmarkDotNet.Artifacts/\n\n# .NET Core\nproject.lock.json\nproject.fragment.lock.json\nartifacts/\n\n# ASP.NET Scaffolding\nScaffoldingReadMe.txt\n\n# StyleCop\nStyleCopReport.xml\n\n# Files built by Visual Studio\n*_i.c\n*_p.c\n*_h.h\n*.ilk\n*.meta\n*.obj\n*.iobj\n*.pch\n*.ipdb\n*.pgc\n*.pgd\n*.rsp\n*.sbr\n*.tlb\n*.tli\n*.tlh\n*.tmp\n*.tmp_proj\n*_wpftmp.csproj\n*.log\n*.vspscc\n*.vssscc\n.builds\n*.pidb\n*.svclog\n*.scc\n\n# Chutzpah Test files\n_Chutzpah*\n\n# Visual C++ cache files\nipch/\n*.aps\n*.ncb\n*.opendb\n*.opensdf\n*.sdf\n*.cachefile\n*.VC.db\n*.VC.VC.opendb\n\n# Visual Studio profiler\n*.psess\n*.vsp\n*.vspx\n*.sap\n\n# Visual Studio Trace Files\n*.e2e\n\n# TFS 2012 Local Workspace\n$tf/\n\n# Guidance Automation Toolkit\n*.gpState\n\n# ReSharper is a .NET coding add-in\n_ReSharper*/\n*.[Rr]e[Ss]harper\n*.DotSettings.user\n\n# TeamCity is a build add-in\n_TeamCity*\n\n# DotCover is a Code Coverage Tool\n*.dotCover\n\n# AxoCover is a Code Coverage Tool\n.axoCover/*\n!.axoCover/settings.json\n\n# Coverlet is a free, cross platform Code Coverage Tool\ncoverage*.json\ncoverage*.xml\ncoverage*.info\n\n# Visual Studio code coverage results\n*.coverage\n*.coveragexml\n\n# NCrunch\n_NCrunch_*\n.*crunch*.local.xml\nnCrunchTemp_*\n\n# MightyMoose\n*.mm.*\nAutoTest.Net/\n\n# Web workbench (sass)\n.sass-cache/\n\n# Installshield output folder\n[Ee]xpress/\n\n# DocProject is a documentation generator add-in\nDocProject/buildhelp/\nDocProject/Help/*.HxT\nDocProject/Help/*.HxC\nDocProject/Help/*.hhc\nDocProject/Help/*.hhk\nDocProject/Help/*.hhp\nDocProject/Help/Html2\nDocProject/Help/html\n\n# Click-Once directory\npublish/\n\n# Publish Web Output\n*.[Pp]ublish.xml\n*.azurePubxml\n# Note: Comment the next line if you want to checkin your web deploy settings,\n# but database connection strings (with potential passwords) will be unencrypted\n*.pubxml\n*.publishproj\n\n# Microsoft Azure Web App publish settings. Comment the next line if you want to\n# checkin your Azure Web App publish settings, but sensitive information contained\n# in these scripts will be unencrypted\nPublishScripts/\n\n# NuGet Packages\n*.nupkg\n# NuGet Symbol Packages\n*.snupkg\n# The packages folder can be ignored because of Package Restore\n**/[Pp]ackages/*\n# except build/, which is used as an MSBuild target.\n!**/[Pp]ackages/build/\n# Uncomment if necessary however generally it will be regenerated when needed\n#!**/[Pp]ackages/repositories.config\n# NuGet v3's project.json files produces more ignorable files\n*.nuget.props\n*.nuget.targets\n\n# Microsoft Azure Build Output\ncsx/\n*.build.csdef\n\n# Microsoft Azure Emulator\necf/\nrcf/\n\n# Windows Store app package directories and files\nAppPackages/\nBundleArtifacts/\nPackage.StoreAssociation.xml\n_pkginfo.txt\n*.appx\n*.appxbundle\n*.appxupload\n\n# Visual Studio cache files\n# files ending in .cache can be ignored\n*.[Cc]ache\n# but keep track of directories ending in .cache\n!?*.[Cc]ache/\n\n# Others\nClientBin/\n~$*\n*~\n*.dbmdl\n*.dbproj.schemaview\n*.jfm\n*.pfx\n*.publishsettings\norleans.codegen.cs\n\n# Including strong name files can present a security risk\n# (https://github.com/github/gitignore/pull/2483#issue-259490424)\n#*.snk\n\n# Since there are multiple workflows, uncomment next line to ignore bower_components\n# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)\n#bower_components/\n\n# RIA/Silverlight projects\nGenerated_Code/\n\n# Backup & report files from converting an old project file\n# to a newer Visual Studio version. Backup files are not needed,\n# because we have git ;-)\n_UpgradeReport_Files/\nBackup*/\nUpgradeLog*.XML\nUpgradeLog*.htm\nServiceFabricBackup/\n*.rptproj.bak\n\n# SQL Server files\n*.mdf\n*.ldf\n*.ndf\n\n# Business Intelligence projects\n*.rdl.data\n*.bim.layout\n*.bim_*.settings\n*.rptproj.rsuser\n*- [Bb]ackup.rdl\n*- [Bb]ackup ([0-9]).rdl\n*- [Bb]ackup ([0-9][0-9]).rdl\n\n# Microsoft Fakes\nFakesAssemblies/\n\n# GhostDoc plugin setting file\n*.GhostDoc.xml\n\n# Node.js Tools for Visual Studio\n.ntvs_analysis.dat\nnode_modules/\n\n# Visual Studio 6 build log\n*.plg\n\n# Visual Studio 6 workspace options file\n*.opt\n\n# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)\n*.vbw\n\n# Visual Studio LightSwitch build output\n**/*.HTMLClient/GeneratedArtifacts\n**/*.DesktopClient/GeneratedArtifacts\n**/*.DesktopClient/ModelManifest.xml\n**/*.Server/GeneratedArtifacts\n**/*.Server/ModelManifest.xml\n_Pvt_Extensions\n\n# Paket dependency manager\n.paket/paket.exe\npaket-files/\n\n# FAKE - F# Make\n.fake/\n\n# CodeRush personal settings\n.cr/personal\n\n# Python Tools for Visual Studio (PTVS)\n__pycache__/\n*.pyc\n\n# Cake - Uncomment if you are using it\n# tools/**\n# !tools/packages.config\n\n# Tabs Studio\n*.tss\n\n# Telerik's JustMock configuration file\n*.jmconfig\n\n# BizTalk build output\n*.btp.cs\n*.btm.cs\n*.odx.cs\n*.xsd.cs\n\n# OpenCover UI analysis results\nOpenCover/\n\n# Azure Stream Analytics local run output\nASALocalRun/\n\n# MSBuild Binary and Structured Log\n*.binlog\n\n# NVidia Nsight GPU debugger configuration file\n*.nvuser\n\n# MFractors (Xamarin productivity tool) working folder\n.mfractor/\n\n# Local History for Visual Studio\n.localhistory/\n\n# BeatPulse healthcheck temp database\nhealthchecksdb\n\n# Backup folder for Package Reference Convert tool in Visual Studio 2017\nMigrationBackup/\n\n# Ionide (cross platform F# VS Code tools) working folder\n.ionide/\n\n# Fody - auto-generated XML schema\nFodyWeavers.xsd"
},
{
"path": "Binaries/CGALDotNet.xml",
"content": "\n\n \n CGALDotNet\n \n \n \n \n The generic arrangment class.\n \n The kernel type.\n \n \n \n The default constructor.\n \n \n \n \n Create a arrangement from a unmanaged ptr.\n \n The unmanaged pointer.\n \n \n \n The arrangement as a string.\n \n \n \n \n \n Assigns the contents of another arrangement. \n \n The other arrangement.\n \n \n \n Computes the overlay of two arrangements and return as a new arrangement.\n \n The other arrangement.\n The overlay of both arrangements.\n \n \n \n Create a deep copy of this arrangment.\n \n The deep copy.\n \n \n \n Insert the polygon into this arrangement.\n \n The polygon.\n If the polygon intersects anything else in the arramgement.\n \n \n \n Insert the polygon into this arrangement.\n \n The polygon.\n If the polygon intersects anything else in the arramgement.\n \n \n \n The abstract base class.\n \n \n \n \n The default constructor.\n \n \n \n \n Create a arrangement from the kernel.\n \n The kernel.\n \n \n \n Create a arrangement from the kernel and unmanaged pointer.\n \n The kernel.\n The unmanaged pointer.\n \n \n \n The arrangements kernel.\n \n \n \n \n The number of vertices in the arrangement.\n \n \n \n \n The number of vertices in the arrangement that are i\n \n \n \n \n returns the number of arrangement vertices that lie at infinity a\n nd are not associated with valid points.\n Such vertices are not considered to be regular arrangement \n vertices and VertexCount does not count them.\n \n \n \n \n The number of half edges.\n \n \n \n \n The number of edges. two half edges count as one edge.\n \n \n \n \n The number of faces in the arrangement not counting\n the unbounded face.\n \n \n \n \n returns the number of unbounded faces in the arrangement.\n Such faces are not considered to be regular arrangement \n faces and FaceCount does not count them.\n \n \n \n \n The type of locator used to find element \n in the arrangement when queried.\n Default is walk which is the best in most cases\n \n \n \n \n Is the arrangement empty.\n \n \n \n \n A number that will change if the unmanaged \n arrangement model changes.\n \n \n \n \n Clear the arrangement.\n \n \n \n \n In particular, the functions checks the topological structure of the arrangement \n and assures that it is valid. In addition, the function performs several simple \n geometric tests to ensure the validity of some of the geometric properties of \n the arrangement. Namely, it checks that all arrangement vertices are associated \n with distinct points, and that the halfedges around every vertex are ordered clockwise.\n \n \n \n \n \n Get a copy of all the points in the arrangement.\n \n A point array that is the length of the vertex count.\n The ararys length.\n \n \n \n Get a copy of all the segments in the arrangment.\n \n A segment array that is the length of the edge count.\n The ararys length.\n \n \n \n Get a copy of all the vertices in the arrangement.\n \n A vertices array that is the length of the vertex count.\n The ararys length.\n \n \n \n Get the vertex from the arrangement.\n \n The index of the vertex.\n The vertex.\n True if the vertex was found.\n \n \n \n Get a copy of all the half edges in the arrangement.\n \n A half edge array that is the length of the half edge count.\n The ararys length.\n \n \n \n Get the half edge from the arrangement.\n \n The index of the half edge.\n The half edge.\n True if the half edge was found.\n \n \n \n Get a copy of all the faces in the arrangement.\n \n A face array that is the length of the facee count.\n The ararys length.\n \n \n \n Get the face from the arrangement.\n \n The index of the half edge.\n The face.\n True if the face was found.\n \n \n \n Create the locator used to find query the arrangement.\n \n The locator type.\n \n \n \n Release the locator. Default will be used..\n Default is walk which is the best in most cases.\n \n \n \n \n Query what the point hits in the arrangment.\n \n The point to query.\n What was hit.\n True if something was hit.\n \n \n \n Query multiple points in the arrangment.\n \n The points to query.\n The results for each point.\n True if any point hit something.\n \n \n \n Query using a ray going up or down (y axis) from the query point.\n \n The point to start at.\n True to shoot ray up, false to shoot down.\n The result of what was hits.\n True if some thing was hit.\n \n \n \n Locate the vertex at this point.\n \n The point to locate vertex at.\n The vertex.\n True if a vertex was located.\n \n \n \n Locate the closest vertex in the hit face\n \n The point\n The radius te closest vertex has to be within.\n The closest vertex.\n True if point hit a face and found a vertex.\n \n \n \n Locate the edge at this point.\n \n The point to locate edge at.\n The edge.\n True if a edge was located.\n \n \n \n Locate the closest edge in the hit face.\n \n The point\n The closest edge.\n The radius from the point a edge counts as being clicked on.\n True if the point hit a face and found a edge.\n \n \n \n Locate the faces at this point.\n \n The point to locate face at.\n The face.\n True if a face was located.\n \n \n \n Find if the arrangement has a element that intersects the segment.\n \n The segment.\n True if the segment intersects something in the arrangement.\n \n \n \n Inserts a given point into a given arrangement.\n It uses a given point-location object to locate the given point in the given arrangement.\n If the point conincides with an existing vertex, there is nothing left to do. if it lies \n on an edge, the edge is split at the point. Otherwise, the point is contained inside a face, \n and is inserted as an isolated vertex inside this face.\n \n The point to insert.\n \n \n \n Insert the segment in to the arrangement.\n \n The segments start point.\n The segments end point.\n True if the segment is know not to \n hit anything currently in the arrangement.\n \n \n \n Insert a segment into the arrangement.\n \n \n True if the segment is know not to \n hit anything currently in the arrangement.\n \n \n \n Insert a array of segments into the arrangement.\n \n The segment array\n The segment arrays length.\n True if the segments are known not to \n hit anything currently in the arrangement.\n \n \n \n Attempts to removed a given vertex from a given arrangement.\n The vertex can be removed if it is either an isolated vertex, \n (and has no incident edge,) or if it is a redundant vertex.That is, \n it has exactly two incident edges, whose associated curves can be \n merged to form a single x-monotone curve.The function returns a \n boolean value that indicates whether it succeeded removing the \n vertex from the arrangement.\n \n The index of the vertex in the arrangement.\n True if the vertex was removed.\n \n \n \n Attempts to removed a given vertex from a given arrangement.\n The vertex can be removed if it is either an isolated vertex, \n (and has no incident edge,) or if it is a redundant vertex.That is, \n it has exactly two incident edges, whose associated curves can be \n merged to form a single x-monotone curve.The function returns a \n boolean value that indicates whether it succeeded removing the \n vertex from the arrangement.\n \n The poisition of the vertex in the arrangement.\n True if the vertex was removed.\n \n \n \n Removes an edge at the index from the arrangement.\n Once the edge is removed, if the vertices associated with its endpoints \n become isolated, they are removed as well.\n \n The index of the one of the half edges in the arrangement.\n True if the edge was removed.\n \n \n \n Removes an edge at the index from the arrangement.\n Once the edge is removed, if the vertices associated with its endpoints \n become isolated, they are removed as well.\n \n A segment with the same positions as the edge in the arrangement.\n True if the edge was removed.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n The generic sweep line class.\n \n The kernel.\n \n \n \n A static instanceof a sweep line.\n \n \n \n \n Default constructor.\n \n \n \n \n Create from a unmanaged pointer.\n \n \n \n \n \n The sweep line as a string.\n \n \n \n \n \n The abstract sweep line.\n \n \n \n \n The default sweep line.\n \n \n \n \n Create from the kernel.\n \n A kernel that implements a sweep line.\n \n \n \n Create from the kernel and unmanaged pointer.\n \n A kernel that implements a sweep line.\n A unmanaged pointer to a sweep line.\n \n \n \n The sweep line kernel.\n \n \n \n \n Do any of the segments in the array intersect.\n \n The segment array.\n The ararys length.\n Do any of the segments in the array intersect.\n \n \n \n Compute all the sub segemnts from the intersection \n of the segments in the array.\n \n The segment array.\n The ararys length.\n The sub segments.\n \n \n \n Compute all the intersection points from the \n segments in the array.\n \n The segment array.\n The ararys length.\n The intersection points.\n \n \n \n Get all the points in the point buffer.\n \n A point array the size of the point buffer.\n The ararys length.\n \n \n \n Get all the segments in the point buffer.\n \n A segment array the size of the segment buffer.\n The ararys length.\n \n \n \n Clear the point buffer.\n \n \n \n \n Clear the segment buffer.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Global utility functions.\n \n \n \n \n Get the version of CGAL in use.\n \n \n \n \n Get the version of eigen being used.\n \n \n \n \n Returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n Returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n Returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n Returns an approximation of the angle between u and v.\n \n The first vector.\n The second vector.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the angle between p-q and r-q.\n \n The first tetrahedrons point.\n The second tetrahedrons point.\n The third tetrahedrons point.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the angle between u and v.\n \n The first vector.\n The second vector.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the angle between p-q and r-q.\n \n The first tetrahedrons point.\n The second tetrahedrons point.\n The third tetrahedrons point.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the signed dihedral angle \n in the tetrahedron pqrs of edge pq.\n p,q,r and p,q,s are not collinear.\n \n The first tetrahedrons point.\n The second tetrahedrons point.\n The third tetrahedrons point.\n The fourth tetrahedrons point.\n The sign is negative if orientation(p,q,r,s) \n is CGAL::NEGATIVE and positive otherwise.\n The angle is given in degrees.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n returns true, if p, q, and r are collinear\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n returns true, if p, q, and r are collinear\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n returns true, if p, q, and r are collinear\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n Returns true, iff p, q, and r are collinear\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Constructs the bisector line of the two points p and q.\n The bisector is oriented in such a way that p lies on its positive side.\n \n The first point.\n The second point.\n Constructs the bisector line of the two points p and q.\n \n \n \n Constructs the bisector of the two lines l1 and l2.\n \n In the general case, the bisector has the direction of\n the vector which is the sum of the normalized directions \n of the two lines, and which passes through the intersection \n of l1 and l2. If l1 and l2 are parallel, then the bisector \n is defined as the line which has the same direction as l1, \n and which is at the same distance from l1 and l2. \n If Kernel::FT is not a model of FieldWithSqrt an \n approximation of the square root will be used in this \n function, impacting the exactness of the result even \n with an (exact) multiprecision number type.\n \n The first line.\n The second line.\n Constructs the bisector of the two lines l1 and l2.\n \n \n \n Constructs the bisector of the two lines l1 and l2.\n \n In the general case, the bisector has the direction of\n the vector which is the sum of the normalized directions \n of the two lines, and which passes through the intersection \n of l1 and l2. If l1 and l2 are parallel, then the bisector \n is defined as the line which has the same direction as l1, \n and which is at the same distance from l1 and l2. \n If Kernel::FT is not a model of FieldWithSqrt an \n approximation of the square root will be used in this \n function, impacting the exactness of the result even \n with an (exact) multiprecision number type.\n \n The first line.\n The second line.\n Constructs the bisector of the two lines l1 and l2.\n \n \n \n Constructs the bisector of the two lines l1 and l2.\n \n In the general case, the bisector has the direction of\n the vector which is the sum of the normalized directions \n of the two lines, and which passes through the intersection \n of l1 and l2. If l1 and l2 are parallel, then the bisector \n is defined as the line which has the same direction as l1, \n and which is at the same distance from l1 and l2. \n If Kernel::FT is not a model of FieldWithSqrt an \n approximation of the square root will be used in this \n function, impacting the exactness of the result even \n with an (exact) multiprecision number type.\n \n The first line.\n The second line.\n Constructs the bisector of the two lines l1 and l2.\n \n \n \n Returns true, if p, q, r, and s are coplanar.\n \n The first point.\n The second point.\n The third point.\n The fourth point\n Returns true, if p, q, r, and s are coplanar.\n \n \n \n If p,q,r are collinear, then CGAL_COLLINEAR is returned.\n If not, then p,q,r define a plane p. The return value in this \n case is either CGAL_POSITIVE or CGAL_NEGATIVE, but we don't \n specify it explicitly. However, we guarantee that all calls to\n this predicate over 3 points in p will return a coherent \n orientation if considered a 2D orientation in p\n \n The first point.\n The second point.\n The third point.\n If p,q,r are collinear, then CGAL_COLLINEAR is returned.\n \n \n \n Let P be the plane defined by the points p, q, and r.\n Note that the order defines the orientation of P. The function computes \n the orientation of points p, q, and s in P: If p, q, s are collinear, \n CGAL_COLLINEAR is returned. If P and the plane defined by p, q,\n and s have the same orientation, CGAL_POSITIVE is returned; \n otherwise CGAL_NEGATIVE is returned.\n p, q, r, and s are coplanar and p, q, and r are not collinear.\n \n The first point.\n The second point.\n The third point.\n The fourth point\n \n \n \n \n Constructs the line which is at the same distance from the three points p, q and r.\n p, q and r are not collinear.\n \n \n \n \n Constructs the line which is at the same distance from the three points p, q and r.\n \n \n \n Returns true if p, q, and r form a left turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a left turn.\n \n \n \n Returns true if p, q, and r form a left turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a left turn.\n \n \n \n Returns true if p, q, and r form a left turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a left turn.\n \n \n \n Returns true if p, q, and r form a right turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a right turn.\n \n \n \n Returns true if p, q, and r form a right turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a right turn.\n \n \n \n Returns true if p, q, and r form a right turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a right turn.\n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n The third point.\n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n The third point.\n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n The third point.\n \n \n \n \n returns LEFT_TURN if u and v form a left turn, returns \n RIGHT_TURN if u and v form a right turn, and returns \n COLLINEAR if u and v are collinear.\n \n \n \n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n \n \n \n \n returns POSITIVE, if s lies on the positive side of the \n oriented plane h defined by p, q, and r, returns NEGATIVE\n if s lies on the negative side of h, and returns COPLANAR \n if s lies on h.\n \n The first point.\n The second point.\n The third point.\n The fourth point\n \n \n \n \n returns NEGATIVE if u, v and w are negatively oriented, \n POSITIVE if u, v and w are positively oriented,\n and COPLANAR if u, v and w are coplanar.\n \n \n \n \n \n \n \n \n computes an orthogonal vector of the plane defined by p, q\n and r, which is directed to the positive side of this plane.\n \n The first point.\n The second point.\n The third point.\n computes an orthogonal vector of the plane\n \n \n \n returns true, if l1 and l2 are parallel or if one of those \n (or both) is degenerate.\n \n The first line.\n The seconed line.\n returns true, if l1 and l2 are parallel\n \n \n \n returns true, if l1 and l2 are parallel or if one of those \n (or both) is degenerate.\n \n The first line.\n The seconed line.\n returns true, if l1 and l2 are parallel\n \n \n \n returns true, if l1 and l2 are parallel or if one of those \n (or both) is degenerate.\n \n The first line.\n The seconed line.\n returns true, if l1 and l2 are parallel\n \n \n \n returns true, if r1 and r2 are parallel or if one of \n those (or both) is degenerate.\n \n The first ray.\n The second ray.\n returns true, if r1 and r2 are parallel\n \n \n \n returns true, if r1 and r2 are parallel or if one of \n those (or both) is degenerate.\n \n The first ray.\n The second ray.\n returns true, if r1 and r2 are parallel\n \n \n \n returns true, if r1 and r2 are parallel or if one of \n those (or both) is degenerate.\n \n The first ray.\n The second ray.\n returns true, if r1 and r2 are parallel\n \n \n \n returns true, if s1 and s2 are parallel or if one of \n those (or both) is degenerate.\n \n The first segment.\n The secong segment.\n returns true, if s1 and s2 are parallel\n \n \n \n returns true, if s1 and s2 are parallel or if one of \n those (or both) is degenerate.\n \n The first segment.\n The secong segment.\n returns true, if s1 and s2 are parallel\n \n \n \n returns true, if s1 and s2 are parallel or if one of \n those (or both) is degenerate.\n \n The first segment.\n The secong segment.\n returns true, if s1 and s2 are parallel\n \n \n \n Base class for objects that referrence a CGAL object.\n \n \n \n \n The pointer to the unmanged CGAL object.\n \n \n \n \n Default constructor.\n \n \n \n \n Constructor taking a referrence to a CGAL object.\n \n A pointer to a CGAL object.\n \n \n \n The destuctor.\n \n \n \n \n Has the object been disposed.\n \n \n \n \n Get the ptr to the CGAL object.\n \n \n \n \n Dispose the CGAL object.\n \n \n \n \n Print some information about the object.\n \n Print some information about the object.\n \n \n \n Print the object into the console.\n \n \n \n \n Print the object into a string builder.\n \n The builder to print into.\n \n \n \n Release the CGAL object.\n \n \n \n \n Swap the unmanaged pointer with another.\n The old ptr will be released first.\n \n The new ptr. The old ptr will be released first.\n \n \n \n Allow derived class to release the unmanaged memory.\n \n \n \n \n Allow derived class to release the unmanaged memory.\n \n \n \n \n Check if the object is still valid.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n enum for egien solvers.\n \n \n \n \n Create a new matrix filled with zeros.\n \n The number of rows.\n The number of columns.\n \n \n \n Create a new matrix fill with the array contents.\n \n The array.\n \n \n \n Create a new matrix filled with the contents of the column vectors.\n All column vectors must have the same dimension.\n \n \n \n \n \n Create a 2 x 2 matrix.\n \n \n \n \n Create a 3 x 3 matrix.\n \n \n \n \n Create a 4 x 4 matrix.\n \n \n \n \n Create a new matrix from a pointer.\n \n \n \n \n \n Create a identity matrix.\n \n The number of rows and columns of the matrix. Must be square.\n The identity matrix.\n \n \n \n Create a matrix filled with the numbers 1, 2. 3, etc to end.\n Used for debugging.\n \n The number of rows.\n The number columns.\n The Matrix.\n \n \n \n \n Create a new matrix fill with random numbers.\n \n The number of rows.\n The number columns.\n The minimum random number generated.\n The maximum random number generated.\n The random generators seed.\n The matrix.\n \n \n \n The number of rows in the matrix.\n \n \n \n \n The number of columns in the matrix.\n \n \n \n \n The total size of the matrix which is \n the rows times the number of columns.\n \n \n \n \n The single dimension array accessor.\n \n The array index.\n The value at the index i.\n \n \n \n The double dimension array accessor.\n \n The row index.\n The column index.\n The value at the index i,j.\n \n \n \n The matrix string info.\n \n The matrix string info.\n \n \n \n The matrix transposed.\n Flips a matrix over its diagonal that is, \n it switches the row and column indices of the matrix.\n \n \n \n \n The matrices conjugate.\n The matrix obtained by replacing each element a(ij) with its complex conjugate, A^=(a^(ij)).\n \n \n \n \n The matrices adjoint.\n The transpose of its cofactor matrix.\n \n \n \n \n Is the matrix invertible.\n \n \n \n \n The inverse of a square matrix A, \n sometimes called a reciprocal matrix, \n is a matrix A^(-1) such that AA^(-1)=I.\n DOes not check if the matrix is invertible.\n \n \n \n \n The determinant is a scalar value that is a \n function of the entries of a square matrix.\n \n \n \n \n The trace of a square matrix is defined to be the \n sum of elements on the main diagonal from the upper left to the lower right.\n \n \n \n \n A square matrix has the same number of rows and columns.\n \n \n \n \n A diagonal matrix is a matrix in which the entries \n outside the main diagonal are all zero.\n \n \n \n \n A square matrix is called upper triangular \n if all the entries below the main diagonal are zero.\n \n \n \n \n A square matrix is called lower triangular \n if all the entries above the main diagonal are zero.\n \n \n \n \n Multiple each component in matrix by the scalar.\n \n The matrix.\n The scalar.\n The matrix with each component multiplied by the scalar.\n \n \n \n Divide each component in matrix by the scalar.\n \n The matrix.\n The scalar.\n The matrix with each component divided by the scalar.\n \n \n \n Multiple the two matrices.\n The first matrices number of columns must \n the same as the second matrices number of rows.\n \n The first matrix.\n The second matrix.\n The product matrix.\n \n \n \n Add two matrices.\n The matrices must be the same size.\n \n The first matrix.\n The second matrix.\n A matrix where each compoent is the sum of the other two matrices.\n \n \n \n Subtract two matrices.\n The matrices must be the same size.\n \n The first matrix.\n The second matrix.\n A matrix where each compoent is the difference of the other two matrices.\n \n \n \n Multiple a matrix and a column vector.\n \n The matrix.\n The column vector.\n The product column vector.\n \n \n \n Is this matrix the identity matrix.\n \n The threshold the values in the \n matrix can be to the expected value.\n Is this matrix the identity matrix.\n \n \n \n Is this matrix filled with zeros.\n \n The threshold the values in the \n matrix can be to the expected value.\n Is this matrix filled with zeros.\n \n \n \n Are all the values in this matrix positive.\n \n Are all the values in this matrix positive.\n \n \n \n Does the matrix have a component that is nan.\n \n Does the matrix have a component that is nan.\n \n \n \n Replaces all nan values in the matrix with 0.\n \n \n \n \n Are all the values in the matrix finite (non-infinite and non-nan).\n \n Are all the values in the matrix finite (non-infinite and non-nan).\n \n \n \n Replaces all infinite and nan values in matrix with 0.\n \n \n \n \n Are all the values in the matrix the same.\n \n The threshold the values in the \n matrix can be to the expected value.\n Are all the values in the matrix the same.\n \n \n \n Create a sub matrix from this matrix.\n \n The row to start at.\n THe column to start at.\n The number of rows.\n The number of columns.\n A sub matrix from this matrix.\n \n \n \n Create a sub matrix from this matrix.\n \n The number of rows.\n The number of columns.\n A sub matrix from this matrix.\n \n \n \n Solve the linear system.\n \n The vector to solve.\n The solver type.\n The solution vector.\n \n \n \n Solve the linear system.\n \n The vector to solve.\n The solver type.\n The solution vector.\n \n \n \n Find the relative error from the linear system.\n \n The vector that was solved.\n The vector that was the solution.\n The relative error.\n \n \n \n Find the relative error from the linear system.\n \n The vector that was solved.\n The vector that was the solution.\n The relative error.\n \n \n \n Find the eigen values of the matrix.\n \n The eigen values if found, null otherwise.\n True if the values could be determined.\n \n \n \n Find the eigen vectors of the matrix.\n \n The eigen vectors if found, null otherwise.\n True if the vectors could be determined.\n \n \n \n \n \n \n \n \n \n \n \n Try and find the inverse of the matrix.\n \n The inverse if found, null otherwise.\n True if the inverse was found.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Create a rotation from a angle and the rotation axis.\n \n The rotation amount.\n The axis to rotate on.\n The rotation matrix.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n /\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The first value in the vector.\n \n \n \n \n The second value in the vector.\n \n \n \n \n The third value in the vector.\n \n \n \n \n The fourth value in the vector.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The generic Box wrapper for a CGAL object.\n \n The kernel type.\n \n \n \n Create box from min and max values.\n \n The min x and y value.\n The max x and y value.\n \n \n \n Create box from min and max points.\n \n The min point.\n The max point.\n \n \n \n Create from a pointer.\n \n The iso rectangle pointer.\n \n \n \n The type of kernel object uses.\n \n \n \n \n The iso rectangle as a string.\n \n The iso rectangle as a string.\n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n Transform the rectangle.\n \n The amount to translate.\n The amount to rotate\n The amount to scale.\n \n \n \n Create a deep copy of the rectangle.\n \n The deep copy.\n \n \n \n The abstract iso rectangle definition.\n \n \n \n \n Default constructor.\n \n \n \n \n \n \n \n \n \n \n \n \n Construct with a new kernel.\n \n The geometry kernel.\n The Box pointer.\n \n \n \n The iso rectangle kernel.\n Contains the functions to the unmanaged CGAL object.\n \n \n \n \n Convert to shape struct.\n \n \n \n \n The rectangles min point.\n \n \n \n \n The rectangles max point.\n \n \n \n \n The rectangles area.\n \n \n \n \n Is the rectangle degenerate.\n \n \n \n \n The side the rectangle the point is on.\n \n The point.\n If the point is iside, outside or on boundary.\n \n \n \n Does the rectangle contain the point.\n \n The point\n Should a point on \n the boundary count as being inside.\n Does the rectangle contain the point\n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n The static intersection class.\n \n \n The static intersection class.\n \n \n The static intersection class.\n \n \n \n --------------------------------------------------------\n \n The Point DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Linet DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Linet DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Linet DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The IsoRectancle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The IsoRectancle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box2 extern functions\n \n -------------------------------------------------------\n \n \n \n Weighted point class\n \n \n \n \n \n Create a new weighted point.\n \n \n \n \n Create a new weighted point from a value and weight as 1.\n \n The points value.\n \n \n \n Create a new weighted point from a x, y value and weight as 1.\n \n The points x value.\n The points y value.\n \n \n \n Create a new weighted point from a x, y value and weight as the w value.\n \n The points x value.\n The points y value.\n The points weight value.\n \n \n \n Create a new weighted point from a pointer.\n \n The pointer.\n \n \n \n The type of kernel object uses.\n \n \n \n \n \n \n \n \n \n \n Create a deep copy of the point.\n \n The deep copy.\n \n \n \n \n \n \n \n \n Create a new weighted point.\n \n The points kernel.\n \n \n \n Create a new weighted point from a x, y value and weight as the w value.\n \n The points x value.\n The points y value.\n The points weight value.\n The points kernel.\n \n \n \n Create a new weighted point from a existing ponter and kernel.\n \n The points kernel.\n The points pointer\n \n \n \n The points kernel.\n \n \n \n \n Release the pointer.\n \n \n \n \n Release the pointer.\n \n The pointer to release.\n \n \n \n Accessor or the points x value.\n \n \n \n \n ccessor or the points y value.\n \n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Clamp the point.\n \n The points min value.\n The points max value.\n \n \n \n Clamp the point.\n \n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n Enum for the type of intersection geomerty.\n \n \n \n \n The intersection result struct.\n May contain up tp 6 points of data.\n \n \n \n \n The point data for the intersection.\n Represents up to 6 points in xy order.\n \n \n \n \n The number of points of data used.\n \n \n \n \n Was there a intersection.\n \n \n \n \n Is the intersection a polygon.\n \n \n \n \n The intersection geometry type.\n \n \n \n \n Array accessor for the point data.\n \n The array index from 0 to 6.\n The point at index i.\n \n \n \n Results information as string.\n \n esults information as string\n \n \n \n If result type was point get the point geometry.\n \n \n \n \n If result type was line get the line geometry.\n \n \n \n \n If result type was ray get the ray geometry.\n \n \n \n \n If result type was segment get the segment geometry.\n \n \n \n \n If result type was box get the box geometry.\n \n \n \n \n If result type was triangle get the triangle geometry.\n \n \n \n \n If result type was polygon get the points that\n make up the polygon geometry.\n Should only ever have at most 6 points.\n \n \n \n \n The intersection result as a polygon.\n \n The polygons kernel.\n The polygon.\n \n \n \n A CGALObject that represents a line on 2D space.\n \n \n \n \n \n A horizontal line on the x axis.\n \n \n \n \n A vertical line on the y axis.\n \n \n \n \n Create a new line where ax + by + c = 0 holds.\n \n The constant in ax.\n The constant in by.\n The constant.\n \n \n \n Create a new line that passes through the two points.\n \n The first point.\n The second point.\n \n \n \n Create a line that passes through the point in the direction of the vector.\n \n The point.\n The vector.\n \n \n \n Create a line from a existing pointer.\n \n The pointer.\n \n \n \n Create a new line that faces in the opposite direction.\n \n \n \n \n \n \n \n \n \n \n Create a new line that is perpendicular to current line.\n \n A point the line should turn ccw when turning.\n The perpendicular line.\n \n \n \n Translate the object.\n \n The amount to translate.\n \n \n \n Rotate the object.\n \n The amount to rotate.\n \n \n \n Scale the object.\n \n The amount to scale.\n \n \n \n Translate, rotate and scale the object.\n \n The amount to translate.\n The amount to rotate in degrees.\n The amount to scale.\n \n \n \n Create a deep copy of the line.\n \n The deep copy.\n \n \n \n The abstract class for the line object.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The lines kernel.\n \n \n \n \n Convert to shape struct.\n \n \n \n \n The lines constant in ax.\n \n \n \n \n The lines constant in by.\n \n \n \n \n The lines constant.\n \n \n \n \n Is the line degenerate.\n \n \n \n \n Is the line horizontal on the x axis.\n \n \n \n \n Is the line vertical on the y axis.\n \n \n \n \n Convert the line to a vector.\n \n \n \n \n Does the point lie on the line.\n \n The point.\n True if the point lies on the line.\n \n \n \n Does the point lies on the negative/cw side of the line.\n \n The point.\n True if the point lies on the negative/cw side of the line.\n \n \n \n Does the point lies on the positive/ccw side of the line.\n \n The point.\n True if the point lies on the positive/ccw side of the line.\n \n \n \n The lines x value given a y value.\n \n The y value.\n The lines x value given a y value.\n \n \n \n The lines y value given a x value.\n \n The x value.\n The lines y value given a x value.\n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of halfs.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The type of kernel object uses.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Clamp the point.\n \n The points min value.\n The points max value.\n \n \n \n Clamp the point.\n \n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n The unit x ray.\n \n \n \n \n The unit y ray.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Convert to shape struct.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n A horizontal line on the x axis.\n \n \n \n \n A vertical line on the y axis.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Convert to shape struct.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Convert to shape struct.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n A Vector2 object with kernel type K.\n \n The type of kernel.\n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n Create a new Vector.\n \n \n \n \n Create a new vector filled with the value.\n \n The value to fill.\n \n \n \n Create a new vector with the values x and y.\n \n The vectors x value.\n The vectors y value.\n \n \n \n Create a new vector from a existing pointer.\n \n The pointer object.\n \n \n \n The type of kernel object uses.\n \n \n \n \n Vector information.\n \n The vectors string information.\n \n \n \n Create a deep copy of the vector.\n \n The deep copy.\n \n \n \n The vectors abstract bass class.\n \n \n \n \n Create a new vector with the kernel.\n \n The vectors kernel.\n \n \n \n Create a new vector from the x and y values.\n \n The vectors x value.\n The vectors y value.\n The vectors kernel.\n \n \n \n Create a new vector from a existing pointer.\n \n The vectors kernel.\n The existing pointer.\n \n \n \n The vectors kernel.\n \n \n \n \n The vectors sqr magnitude.\n \n \n \n \n The vectors sqr magnitude.\n \n \n \n \n Access the x component.\n \n \n \n \n Access the y component.\n \n \n \n \n Release the vectors pointer.\n \n \n \n \n Release a pointer to a vector.\n \n The pointer to release.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Clamp the vector.\n \n The vectors min value.\n The vectors max value.\n \n \n \n Clamp the vector.\n \n \n \n \n Normalize the vector.\n \n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n The convex hull method to use.\n \n \n \n \n The generic convex hull class.\n \n The kernel type\n \n \n \n The static instance.\n \n \n \n \n Default constructor.\n \n \n \n \n \n \n \n \n \n \n Find the convex of the points.\n \n The point array.\n The ararys length.\n The hull ethod to use.\n A polygon that represents the convex hull.\n \n \n \n Find the upper hull of points.\n \n The point array.\n The ararys length.\n A polygon that represents the upper hull.\n \n \n \n Find the lower hull of points.\n \n The point array.\n The ararys length.\n A polygon that represents the lower hull.\n \n \n \n The convex hull abstract base class.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct hull with the kernel.\n \n The kernel\n \n \n \n The hulls kernel type.\n \n \n \n \n Is this set of points ccw orderer.\n \n The point array.\n The ararys length.\n Is this set of points ccw orderer.\n \n \n \n Is this set of points cw orderer.\n \n The point array.\n The ararys length.\n Is this set of points cw orderer.\n \n \n \n Checks if the minimum number of points have been provided.\n \n The point array length.\n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n The generic convex hull class.\n \n The kernel type\n \n \n \n The static instance.\n \n \n \n \n Default constructor.\n \n \n \n \n \n \n \n \n \n \n Create the convex hull from a set of points.\n \n The point array.\n The point arrays length\n The hull as a polyhedron.\n \n \n \n Create the convex hull from a set of points.\n \n The point array.\n The point arrays length\n The hull as a surface mesh.\n \n \n \n The convex hull abstract base class.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct hull with the kernel.\n \n The kernel\n \n \n \n The hulls kernel type.\n \n \n \n \n Check if the points in the polyhedron are convex.\n \n The polyhedron.\n True if the polyhedron is convex.\n \n \n \n Check if the points in the mesh are convex.\n \n The mesh.\n True if the mesh is convex.\n \n \n \n Checks if the minimum number of points have been provided.\n \n The point array length.\n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n A static instance of the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as a string.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retain the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retain the poylgons edges.\n \n The polygon to insert.\n \n \n \n A deep copy of the triangulation.\n \n The deep copy.\n \n \n \n \n \n \n \n \n The max value the angle bounds can be.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The number of verices in the triangulation.\n \n \n \n \n The number of triangles in the triangulation.\n \n \n \n \n The number of indices need to represent the\n triangulation (number of triangles * 3).\n \n \n \n \n The conforming triangulation kernel.\n \n \n \n \n Clear the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the triangulation.\n \n The amount to translate.\n \n \n \n Rotate the triangulation.\n \n The amount to rotate in radians.\n \n \n \n Scale the triangulation.\n \n The amount to scale.\n \n \n \n Transform the triangulation with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Make the mesh delaunay.\n \n \n \n \n Make the mesh \n \n \n \n \n Refine the mesh into smaller triangles.\n \n Default shape bound. 0.125 corresponds to abound 20.6 degree. Max 0.125 value.\n Upper bound on the length of the longest edge.\n \n \n \n Refine the mesh into smaller triangles.\n \n Default shape bound. 0.125 corresponds to abound 20.6 degree. Max 0.125 value.\n Upper bound on the length of the longest edge.\n Seeds point in polygons that are not to be refined.\n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n A static instance of the tetrahedral remeshing.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The tetrahedral remeshing kernel.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Generic polygon definition.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Create from a set of points.\n \n The polygons points.\n \n \n \n Create from a pointer.\n \n The polygons pointer.\n \n \n \n The polygon as a string.\n \n The polygon as a string.\n \n \n \n Copy the polygon.\n \n The copied polygon.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n The intersection results.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n The intersection results.\n Do the polygons intersect.\n \n \n \n Refine the polygon to a triangulation.\n Does not modify this polygon.\n \n Upper bound on the length of the longest edge.\n The base triangulation.\n \n \n \n Refine the polygon to a triangulation.\n Does not modify this polygon.\n \n Default shape bound. 0.125 corresponds to abound 20.6 degree. Max 0.125 value.\n Upper bound on the length of the longest edge.\n The base triangulation.\n \n \n \n Partition the polygon into convex pieces.\n Does not modify this polygon.\n \n The convex partition.\n The type of partition method.\n \n \n \n Simplify the polygon.\n \n The simplification threshold.\n \n \n \n Simplify the polygon.\n \n The simplification parameters.\n \n \n \n offset the polygon. Does not modify this polygon.\n \n The type of offset.\n The amount to offset.\n The offset results.\n \n \n \n Create a polyhedron3 mesh with one polygon face.\n \n Should the y coord of the points be used for the z coord.\n The new polyhedron mesh\n Thrown if the polygon is not simple.\n \n \n \n Get the dual polygon where every point s now a edge.\n \n The dual polygon.\n \n \n \n The abstract polygon definition.\n \n \n \n \n Is the polygon simple.\n Must be updated to find if simple.\n \n \n \n \n The polygons orientation.\n Must be updated to find orientation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The polygon kernel.\n \n \n \n Construct with a new kernel.\n \n The polygon kernel.\n The points to construct from.\n \n \n \n Construct with a new kernel.\n \n The polygon kernel.\n The polygons pointer.\n \n \n \n The number of points in the polygon.\n \n \n \n \n The capacity of the point array.\n \n \n \n \n Is this a simple polygon.\n Certains actions can only be carried out on simple polygons.\n \n \n \n \n The polygons orientation.\n Certain actions depend on the polygons orientation.\n \n \n \n \n The orientation expressed as the clock direction.\n \n \n \n \n Is the polygon degenerate.\n Polygons with less than 3 points are degenerate.\n \n \n \n \n Is the polygon cw orientated.\n \n \n \n \n Is the polygon ccw orientated.\n \n \n \n \n Is the polygon updated.\n \n \n \n \n The polygons kernel.\n Contains the functions to the unmanaged CGAL polygon.\n \n \n \n \n The type of kernel object uses.\n \n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n \n \n \n \n \n Mark th mesh as needing to be updated.\n \n \n \n \n Valid polygons should be simple and ccw \n for most algorithms to work on them.\n \n \n \n \n Valid hole polygons should be simple\n and cw to add to a polygon with holes.\n \n \n \n \n Clear the polygon of all points.\n \n \n \n \n Shrink the capacity to match the point count.\n \n \n \n \n Resize the point array.\n New elements will default to zero.\n \n \n \n \n \n Remove the point at the index from the array.\n \n The points index\n \n \n \n Remove a range of points from the array.\n \n The starting index\n The number of points to remove.\n \n \n \n Insert the point at the index into the array.\n \n The points index.\n The point to insert.\n \n \n \n Insert a range of points into the array.\n \n The starting index\n The points to insert.\n The number of points to insert.\n \n \n \n Add the point to the end of the poylgon.\n \n The point to add.\n \n \n \n Get the point a the index.\n \n The points index to get.\n The point at index.\n \n \n \n Get the point at the index\n and wrap around the polygon.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polygons last point.\n \n The points index.\n The point at the index.\n \n \n \n Get all the points in the polygon.\n \n The point array to copy the data into.\n The array length.\n \n \n \n Get all the polygon points.\n \n The list to copy the data into.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Get all the polygon segments.\n \n The segment array to copy the data into.\n The array length.\n \n \n \n Set the points at the index.\n \n The points index.\n The points value.\n \n \n \n Set the points from the array.\n If the array is larger than the polygon then \n the new points will be appended to end of polygon.\n \n The points array.\n The array length.\n \n \n \n Reverse the polygon.\n Swithches the orientation.\n \n \n \n \n Find the bounding box for the polygon.\n \n The bounding box.\n \n \n \n Find if the polygon is simple.\n \n True if simple.\n \n \n \n Find if the polygon is convex.\n Must be simple to determine.\n \n True if the polygon is convex.\n \n \n \n Find the polygons orientation.\n Must be simple to determine.\n \n The polygons orientations.\n \n \n \n Find the orientated side the point lies on.\n Must be simple to determine.\n \n The point.\n The orientated side of the polygon the point is on.\n \n \n \n Find the bounded side the point lies on.\n Must be simple to determine.\n \n The point.\n The bounded side of the polygon the point is on.\n \n \n \n Find the polygons signed area. \n Must be simple to determine.\n \n The signed area is positive if polygon is ccw \n and negation if cw.\n \n \n \n The area of the polygon.\n Must be simple to determine.\n \n The abs of the signed area.\n \n \n \n Find the perimeter.\n This is the length of the polygon boundary.\n \n \n \n \n \n Find the square perimeter.\n This is the square length of the polygon boundary.\n \n \n \n \n \n Does the polygon contain the points.\n Must be simple to determine.\n \n The point to find.\n Does the point on the boundary count\n True if the point is inside the polygon.\n \n \n \n Round each point it polygon to a number of digits.\n \n The number of digits to round to.\n \n \n \n Translate the polygon.\n \n The amount to translate.\n \n \n \n Rotate the polygon.\n \n The amount to rotate in radians.\n \n \n \n Scale the polygon.\n \n The amount to scale.\n \n \n \n Transform the polygon with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Return all the points in the polygon in a array.\n \n The array.\n \n \n \n Get all the points in the polygon into a list.\n \n \n \n \n Convert the polygon to a new polygon with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polygon.\n \n \n \n Truncate a point in the polygon by splitting\n the point and shifting toward its neghbours.\n \n The points index in mesh.\n The amount to truncale.\n \n \n \n Print the polygon into a styring builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Update the polygon if needed.\n \n \n \n \n Update the polygon directly without calling the update\n function.\n \n Is the polygon simepl.\n The polygons orientation.\n \n \n \n Should the input polygon be checked.\n Can disable for better performance if \n it is know all input if valid.\n \n \n \n \n Check if the polygon is valid to offset.\n Should be simple and ccw.\n \n The polygon to check.\n \n \n \n Check if the polygon is valid to offset.\n Should be simple and ccw.\n \n The polygon to check.\n \n \n \n The type of boolean ops.\n \n \n \n \n Generic polygon boolean class.\n \n The type of kernel\n \n \n \n A static instance to the boolean class.\n \n \n \n \n Create a new object.\n \n \n \n \n \n \n \n \n \n \n Perform the boolean op on the two polygons.\n \n The type of op.\n A simple ccw polygon.\n A simple ccw polygon.\n The result of the op.\n If the op was performed and the result list changed.\n \n \n \n Perform the boolean op on the two polygons.\n \n The type of op.\n A simple ccw polygon.\n A simple ccw polygon.\n The result of the op.\n If the op was performed and the result list changed.\n \n \n \n Perform the boolean op on the two polygons.\n \n The type of op.\n A simple ccw polygon.\n A simple ccw polygon.\n The result of the op.\n If the op was performed and the result list changed.\n \n \n \n Check if the polygons intesect.\n \n A simple ccw polygon.\n A simple ccw polygon.\n If the polygons intesect.\n \n \n \n Check if the polygons intesect.\n \n A simple ccw polygon.\n A simple ccw polygon.\n If the polygons intesect.\n \n \n \n Check if the polygons intesect.\n \n A simple ccw polygon.\n A simple ccw polygon.\n If the polygons intesect.\n \n \n \n The union of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The union of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The union of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The union of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The union of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The union of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The intersection of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The intersection of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The intersection of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The intersection of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The intersection of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The intersection of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The symmetric difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The symmetric difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The symmetric difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The symmetric difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The symmetric difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The symmetric difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The complement of the polygon.\n \n A simple ccw polygon.\n The complement of the polygon.\n \n \n \n Copy the unmanaged polygon objects created \n into the result list.\n \n The number of objects in the buffer.\n The result lis.\n \n \n \n Copy the unmanaged polygon object.\n \n The index of the polygon in the buffer.\n The polygon copy.\n \n \n \n Abstract base class for polygon boolean.\n \n \n \n \n The polygon boolean kernel.\n \n \n \n \n Clear the unmanaged buffer.\n \n \n \n \n Release the unmanaged resourses.\n \n \n \n \n Factory for creating polygons.\n \n The kernel type.\n \n \n \n Create a empty polygon.\n \n \n \n \n \n Create a polygon from a triangle.\n \n The triangle first point.\n The triangle second point.\n The triangle third point.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a triangle.\n \n The triangle.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a box.\n \n The boxs min point.\n The boxs max point.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a box.\n \n The boxs min point.\n The boxs max point.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a box.\n \n The box.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a dounut.\n Outer radius must be greater than inner.\n \n The outer radius.\n The inner radius\n The number of segments.\n The created polygon with holes\n \n \n \n Create a polygon from a dounut.\n Outer radius must be greater than inner.\n \n The center position of the polygon.\n The outer radius.\n The inner radius\n The number of segments.\n The created polygon with holes\n \n \n \n Create a polygon from a circle.\n \n The radius of the circle.\n The number of segments.\n True for a counter clock wise polygon, false for a clock wise polygon\n The polygon.\n \n \n \n Create a polygon from a circle.\n \n The center of the circle.\n The radius of the circle.\n The number of segments.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n Create a polygon from a circle.\n \n The cirlce.\n The number of segments.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n https://rosettacode.org/wiki/Koch_curve#C.2B.2B\n \n The size of the polygon.\n The number of times to sub divide.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n https://rosettacode.org/wiki/Koch_curve#C.2B.2B\n \n The stars center.\n The size of the polygon.\n The number of times to sub divide.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n https://rosettacode.org/wiki/Koch_curve#C.2B.2B\n \n \n \n \n \n \n Decomposition stratergy for polygons.\n \n \n \n \n Decomposition stratergy for polygons with holes.\n \n \n \n \n Generic Minkowski class.\n \n The type of kernel\n \n \n \n A static instance to the Minkowski class.\n \n \n \n \n Create a new object.\n \n \n \n \n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n The decomposition method.\n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n The decomposition method.\n \n \n \n \n \n \n It is based on the angle-bisector decomposition method suggested by Chazelle and Dobkin [4],\n which runs in O(n2) time. In addition, it applies a heuristic by Flato that reduces the number\n of output polygons in many common cases. The convex decompositions that it produces usually \n yield efficient running times for Minkowski sum computations. It starts by examining each pair \n of reflex vertices in the input polygon, such that the entire interior of the diagonal \n connecting these vertices is contained in the polygon. Out of all available pairs, the vertices\n pi and pj are selected, such that the number of reflex vertices encountered when traversing \n the boundary of the polygon from pi to pj in clockwise order is minimal. The polygon is split \n by the diagonal pipj. This process is repeated recursively on both resulting sub-polygons. \n In case it is not possible to eliminate two reflex vertices at once any more, each reflex \n vertex is eliminated by a diagonal that is closest to the angle bisector emanating from this \n vertex and having rational-coordinate endpoints on both sides.\n \n \n \n \n \n \n \n Uses the dynamic-programming algorithm of Greene [6] for computing an optimal decomposition of \n a polygon into a minimal number of convex sub-polygons. While this algorithm results in a small\n number of convex polygons, it consumes rather many resources, as it runs in O(n4) time and O(n3) \n space in the worst case, where n is the number of vertices in the input polygon.\n \n \n \n \n \n \n \n Implements the approximation algorithm suggested by Hertel and Mehlhorn [8], which triangulates \n the input polygon and then discards unnecessary triangulation edges. After triangulation (carried \n out by the constrained-triangulation procedure of CGAL) the algorithm runs in O(n) time and space,\n and guarantees that the number of sub-polygons it generates is not more than four times the optimum.\n \n \n \n \n \n \n \n Implementation of Greene's approximation algorithm [6], which computes a convex decomposition of the \n polygon based on its partitioning into y-monotone polygons. This algorithm runs in O(nlogn) time and \n O(n) space, and has the same guarantee on the quality of approximation as Hertel and Mehlhorn's algorithm.\n \n \n \n \n \n \n \n Uses vertical decomposition to decompose the underlying arrangement.\n \n \n \n \n \n \n \n Uses vertical decomposition to decompose the underlying arrangement.\n \n \n \n \n \n \n \n Uses constrained triangulation to decompose the input polygons, which may have holes, into triangles.\n \n \n \n \n \n \n \n Uses constrained triangulation to decompose the input polygons, which may have holes, into triangles.\n \n \n \n \n \n \n \n Abstract base class for polygon minkowski.\n \n \n \n \n The polygon Minkowski kernel.\n \n \n \n \n Release the unmanaged resourses.\n \n \n \n \n The generic polgon offset class\n \n \n \n \n \n Static instance of polygon offset.\n \n \n \n \n Create new polygon offset.\n \n \n \n \n \n \n \n \n \n \n Create a interior or exterior offset.\n \n The offset type\n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a interior or exterior offset.\n \n The offset type\n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a interior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a interior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a exterior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a exterior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create the interior skeleton of the polygon.\n \n The polygon to offset.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n Create the interior skeleton of the polygon.\n \n The polygon to offset.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n Create the exterior skeleton of the polygon.\n \n The polygon to offset.\n The bounding boxes offset from the polygons edges. Must be > 0.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n Create the exterior skeleton of the polygon.\n \n The polygon to offset.\n The bounding boxes offset from the polygons edges. Must be > 0.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n The abstract polygon offset class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The offset kernel.\n \n \n \n \n Get the number off polygons in the buffer.\n \n \n \n \n \n The size of the segment buffer.\n \n The number of segments in the buffer.\n \n \n \n Get the unmanaged point to the polygon at the buffer index\n \n The index in the buffer.\n The pointer\n \n \n \n Get the segment from buffer.\n \n The segments index.\n The segment.\n \n \n \n Clear the polygon buffer.\n \n \n \n \n Clear the segment buffer.\n \n \n \n \n Release the unmanaged resources.\n \n \n \n \n Type of polygon partitions.\n \n \n \n \n Generic polygon partition class.\n \n The kernel type.\n \n \n \n Static instance of polygon partition.\n \n \n \n \n Create new polygon partition.\n \n \n \n \n \n \n \n \n \n \n Is this polygon Y monotonic.\n \n The polygon.\n True if y monotonic.\n \n \n \n Is this polygon Y monotonic.\n \n The polygon.\n True if y monotonic.\n \n \n \n Partition a polygon.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition a polygon.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition a polygon.\n \n The type of partition to perfrom.\n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition a polygon.\n \n The type of partition to perfrom.\n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition in to Y monotonic polygons.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition in to Y monotonic polygons.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of \n convex polygons produced is minimal.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of \n convex polygons produced is minimal.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Copy the new polygons into the result array\n and the clear the buffer.\n \n The number of polygons in buffer.\n The resulting polygons.\n \n \n \n The abstract base class.\n \n \n \n \n The partition kernel.\n \n \n \n \n Clear the unmanaged buffer.\n \n \n \n \n Release the unmanaged resources.\n \n \n \n \n Cost options for simplification.\n \n \n \n \n Stop distance options for simplification.\n \n \n \n \n Paramaters for poylgon simplification.\n \n \n \n \n The default param settings.\n \n \n \n \n The param as a string.\n \n \n \n \n \n Generic polygon simplification class.\n \n The kernel type.\n \n \n \n Static instance of polygon simplification.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Simplify the polygon.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify the polygon.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon ptr.\n \n \n \n Simplify the polygons boundary and all the holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify the polygons boundary and all the holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygons ptr.\n \n \n \n Simplify the polygons boundary.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify the polygons holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify one of the polygons holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The hole index to simplify.\n The simplified polygon.\n \n \n \n Abstract polygon simplification class.\n \n \n \n \n The simplification kernel.\n \n \n \n \n Release unmanaged resources.\n \n \n \n \n The generic polgon visibility class\n \n \n \n \n \n Static instance of polygon visibility.\n \n \n \n \n Create new polygon visibility.\n \n \n \n \n \n \n \n \n \n \n Compute the visibility from a simple polygon with no holes.\n This class implements the algorithm of B.Joe and R.B.Simpson [4]. The algorithm is a modification\n and extension of the linear time algorithm of Lee [5]. It computes the visibility region from a \n viewpoint that is in the interior or on the boundary of the polygon.\n While scanning the boundary the algorithm uses a stack to manipulate the vertices, and ultimately\n yields the visibility region.For each scanned edge, at most 2 points are pushed onto the stack.\n Overall, at most 2 n points are pushed or popped. Thus, the time and space complexities of the\n algorithm are O(n) even in case of degeneracies such as needles, where n is the number of the vertices of the polygon.\n \n The visibility point.\n A simple polygon that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes.\n \n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes.\n \n What method to use.\n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes using the triangular expansion method.\n The algorithm does not require preprocessing. It relies on the algorithm of T. \n Asano [1] based on angular plane sweep, with a time complexity of O(nlogn) in the number of vertices.\n \n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes using the rotational sweep method.\n The algorithm obtains a constrained triangulation from the input arrangement, then computes visibility by \n expanding the triangle that contains the query point. Preprocessing takes O(n) time and O(n) space, where \n n is the number of vertices of input polygon. The query time is O(nh), where h is the number of holes+1 of \n input polygon. Thus, for simple polygons (or a polygon with a constant number of holes) the algorithm \n complexity is linear, but it is O(n2) in the worst case, as the number of holes can be linear in n.\n \n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n The abstract polygon visibility class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The offset kernel.\n \n \n \n \n Release the unmanaged resources.\n \n \n \n \n Polygon with holes consists of a boundary and holes.\n \n \n \n \n Generic polygon definition.\n \n The kernel type.\n \n \n \n Default constuctor.\n \n \n \n \n Construct polygon with the boundary.\n \n A CCW polygon.\n \n \n \n Construct polygon with the boundary points\n \n A CCW set of points.\n \n \n \n Create from a pointer.\n \n The polygons pointer.\n \n \n \n The polygon as a string.\n \n The polygon as a string.\n \n \n \n Create a deep copy of the polygon.\n \n The copy.\n \n \n \n Create a deep copy of the polygon element.\n \n The element type to copy.\n If element os a hole thiss is the holes index.\n The copy.\n \n \n \n Get the boundary as a copy.\n If unbounded will return a empty polygon.\n \n A copy of the hole polygon.\n \n \n \n Get the hole as a copy.\n \n The holes index\n A copy of the hole polygon.\n \n \n \n Add a polygon as a holes.\n Holes must simple and CW.\n \n The hole polygon.\n \n \n \n Create a copy of boundary and hole polygons.\n \n The list of polygons.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Connect all the holes of the polygon \n and return as a polygon. \n Will result in a non simple polygon.\n \n The connected non-simple polygon.\n \n \n \n Partition the polygon into convex pieces.\n \n The convex partition.\n The type of partition method.\n \n \n \n Simplify the polygon.\n \n The simplification threshold.\n \n \n \n Simplify the polygon.\n \n The simplification parameters.\n \n \n \n offset the polygon. Does not modify this polygon.\n \n The type of offset.\n The amount to offset.\n The offset results.\n \n \n \n The abstract polygon definition.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct polygon with the kernel.\n \n \n \n \n \n Construct the polygon with the kernel and boundary.\n \n \n A CCW polygon.\n \n \n \n Construct the polygon with the kernel and boundary.\n \n \n A CCW set of points.\n \n \n \n Construct the polygon with the kernel and pointer.\n \n \n \n \n \n \n Is the polygon unbounded. \n ie no boundary polygon has been set.\n \n \n \n \n Is the polygon bounded. \n ie a boundary polygon has been set.\n \n \n \n \n Number of points in the boindary polygon.\n \n \n \n \n The number of holes in polygon.\n \n \n \n \n Is this a simple polygon.\n Certains actions can only be carried out on simple polygons.\n \n \n \n \n The polygons orientation.\n Certain actions depend on the polygons orientation.\n \n \n \n \n The orientation expressed as the clock direction.\n \n \n \n \n Is the polygon degenerate.\n Polygons with less than 3 points are degenerate.\n \n \n \n \n Is the polygon cw orientated.\n \n \n \n \n Is the polygon ccw orientated.\n \n \n \n \n The polygon kernel.\n \n \n \n \n The type of kernel object uses.\n \n \n \n \n Valid polygon with holes must have a simple and ccw boundary\n and all holes must be simple and cw.\n \n \n \n \n \n Valid holes must be simple, cw and must be contained\n within the boundary polygon.\n \n \n \n True if the polygon is a valid hole.\n \n \n \n Clear the polygon.\n \n \n \n \n Clear the polygons boundary.\n \n \n \n \n Clear the polygons holes.\n \n \n \n \n Get the number of points of a polygon element.\n \n The element type.\n If element type is a hole this is the holes index.\n \n \n \n \n Remove a polygon.\n Can remove the boundary or a hole.\n \n The element type.\n If element type is a hole this is the holes index.\n \n \n \n Remove a hole from the polygon.\n \n The holes index.\n \n \n \n Reverse the polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n \n \n \n Get a polygons point.\n \n The element type.\n The index of the point in the polygon.\n If element type is a hole this is the holes index.\n \n \n \n \n Get the points in the polygon element.\n \n The element type.\n The point array to copy points into.\n The ararys length.\n If element type is a hole this is the holes index.\n \n \n \n Set a polygons point.\n \n The element type.\n The index of the point in the polygon.\n The point to set.\n If element type is a hole this is the holes index.\n \n \n \n Set all the points in the polygon. If the point array is longer\n than the polygon is current the extra points are appended to the end.\n \n The element type.\n The points to set.\n The ararys length.\n If element type is a hole this is the holes index.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Add a hole from a set of points.\n \n A CW set of points.\n The ararys length.\n \n \n \n Find if the polygon has a boundary.\n \n True if the polygon has a boundary.\n \n \n \n Find the polygons bounding box.\n \n The element type.\n If element type is a hole this is the holes index.\n The polygons bounding box.\n \n \n \n Find if the polygon is simple.\n \n The element type.\n If element type is a hole this is the holes index.\n True if the polygon is simple.\n \n \n \n Find if the polygon is convex.\n \n The element type.\n If element type is a hole this is the holes index.\n True if polygon is convex.\n \n \n \n Find the orientation of polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n The orientation of the polygon.\n \n \n \n Find the orientated side the point is on.\n \n The element type.\n \n If element type is a hole this is the holes index.\n The orientated side of point compared to the polygon.\n \n \n \n The signed area of the polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n The signed area is positive if polygon is ccw \n and negation if cw.\n \n \n \n The area of the polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n The polygons area.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Return all the points in the polygon in a array.\n \n The array.\n \n \n \n Get all the points in the polygons boundary into a list.\n \n \n \n \n Get all the points in the polygon boundary and holes.\n \n The point array to copy into.\n \n \n \n Round each point it polygon to a number of digits.\n \n The number of digits to round to.\n \n \n \n Convert the polygon to a new polygon with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polygon.\n \n \n \n Release the unmanaged resoures.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Does the polygon fully contain the other polygon.\n \n The other polygon.\n Should the boundary be included.\n True if the polygon is contained within this polygon.\n \n \n \n Does this polygon contain the point.\n \n The point.\n Should points on the boundary be \n counted as being inside the polygon.\n True if the polygon contain the point.\n \n \n \n Translate the polygon.\n \n The amount to translate.\n \n \n \n Translate the polygon.\n \n The element type.\n The amount to translate.\n If element type is a hole this is the holes index.\n \n \n \n Rotate the polygon.\n \n The amount to rotate in radians.\n \n \n \n Rotate the polygon.\n \n The element type.\n The amount to rotate in radians.\n If element type is a hole this is the holes index.\n \n \n \n Rotate the polygon.\n \n The amount to scale.\n \n \n \n Scale the polygon.\n \n The element type.\n The amount to scale.\n If element type is a hole this is the holes index.\n \n \n \n Transform the polygon.\n \n The amount to translate.\n The amount to rotate in radians.\n The amount to scale.\n \n \n \n Transform the polygon.\n \n The element type.\n The amount to translate.\n The amount to rotate in radians.\n The amount to scale.\n If element type is a hole this is the holes index.\n \n \n \n Print debug infomation.\n \n \n \n \n \n Number of vertices.\n \n \n \n \n Number of faces.\n \n \n \n \n Number of halfedges.\n \n \n \n \n Number of border edges.\n Since each border edge of a polyhedral surface has exactly one \n border halfedge, this number is equal to size of border halfedges.\n \n \n \n \n Returns true if the polyhedral surface is combinatorially consistent.\n Must be a valid mesh to check many other properties.\n \n \n \n \n Returns true if there are no border edges.\n \n \n \n \n Returns true if all faces are triangles.\n \n \n \n \n Returns true if all faces are quads.\n \n \n \n \n Is this a valid triangle mesh.\n \n \n \n \n Is this a valid closed mesh.\n \n \n \n \n Is this a valid closed triangle mesh.\n \n \n \n \n The current build stamp.\n \n \n \n \n Clear the mesh.\n \n \n \n \n Clear the normal maps.\n \n True to clear the vertex normal map.\n True to clear the face normal map. \n \n \n \n Create a mesh from the points and indices.\n \n The meshes points.\n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Create a triangle mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a quad mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a mesh with quads and triangles.\n \n The meshes points.\n The point array length.\n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Create a mesh with riangles, quads, pentagons and hexagons.\n \n The meshs points.\n The length of the point array.\n The faces indices.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces points\n The length of the point array.\n Should the y coord of the points be used for the z coord.\n \n \n \n Get the triangle and quad indices.\n \n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Get the meshes triangles.\n \n The meshes triangles.\n The triangle array length.\n \n \n \n Get the meshes quads.\n \n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles and quads.\n \n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles, quads, pentagons and hexagons.\n \n The indices.\n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n The points index.\n The vertices point.\n \n \n \n Get the vertices point.\n \n The vertex index in the mesh.\n The vertices point.\n If index is out of range.\n \n \n \n Get the points in the mesh.\n \n The array to copy points into.\n The point array length.\n \n \n \n Set the point at the index.\n \n The points index\n The pointsam>\n If index is out of range.\n \n \n \n Set the points from a array.\n \n The point array.\n The point arrays length.\n \n \n \n Get a halfedges segment.\n \n The halfedges index.\n The segment.\n True if halfedge found.\n \n \n \n Get a segment for each halfedge in the mesh.\n \n The segment array.\n The segment array length.\n \n \n \n Get the faces triangle. \n Presumes face is a triangle with no checks.\n \n The faces index.\n The faces triangle\n \n \n \n \n Get a triangle for each face in the mesh.\n Presumes all faces are triangles with no checks.\n \n The trainagle array.\n The traingle arrays length.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the vertices in the mesh.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n True if the face was found.\n \n \n \n Get the faces in the mesh.\n \n The face array.\n The face array length.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n The halfedge.\n True if the halfedge was found.\n \n \n \n Get the halfedges in the mesh.\n \n The halfedge array.\n The halfedge array length.\n \n \n \n Count the number of triangles, quads and polygons in the mesh.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Count the number of triangles, quads and polygons in the dual mesh.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Get a centroid (the avergae face position) for each face in the mesh.\n \n The point array.\n The points arrays lemgth.\n \n \n \n Computes the vertex normals if needed.\n \n \n \n \n Computes the face normals if needed.\n \n \n \n \n Get the vertex normals.\n \n The normals array.\n The normals array length.\n \n \n \n Get the face normals.\n \n The normals array.\n The normals array length.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Make all faces triangles.\n \n \n \n \n Read data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Write data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Print the mesh into a string builder.\n \n \n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Find what side of the mesh the lies in.\n \n The point to check.\n ON_BOUNDED_SIDE if point inside mesh, \n ON_UNBOUNDED_SIDE if point not inside, \n ON_BOUNDARY if point is on the surface.\n \n \n \n Does the mesh contain the point.\n \n The point.\n If point is on the boundary does it count a being contained.\n True if the poly contains the point\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n Locate the face hit by the ray.\n \n The ray.\n The hit face.\n True if the ray hit a face.\n \n \n \n Locate the vertex hit by the ray.\n \n The ray.\n The distance the vertex has to be within hit point.\n The hit vertex.\n True if the ray hit a vertex.\n \n \n \n Locate the edge hit by the ray.\n \n The ray.\n The distance the edge has to be within hit point.\n The hit edge.\n True if the ray hit a edge.\n \n \n \n The faces index\n \n \n \n \n THe faces edge\n \n \n \n \n A face where all compents are null index.\n \n \n \n \n \n \n \n \n \n \n Are these faces equal.\n \n \n \n \n \n \n \n Are these faces not equal.\n \n \n \n \n \n \n \n Are these objects equal.\n \n \n \n \n \n \n Are these faces equal.\n \n \n \n \n \n \n The faces hash code.\n \n \n \n \n \n Enmerate all edges in this edge loop.\n \n The mesh the edges belong too.\n The next edge\n \n \n \n Enmerate all vertices in this edge loop.\n \n The mesh the edges belong too.\n The next vertex\n \n \n \n https://github.com/caosdoar/spheres/blob/master/src/spheres.cpp\n https://github.com/mrdoob/three.js/tree/dev/src/geometries\n \n \n \n \n Is the edge a border to a hole.\n \n \n \n \n The edges index.\n \n \n \n \n The edges source vertices index.\n \n \n \n \n The edges target vertices index.\n \n \n \n \n The edges opposite edge.\n \n \n \n \n The edges next edge.\n \n \n \n \n The edges previous edge.\n \n \n \n \n The edges face\n \n \n \n \n A edge where everthing is set to null index.\n \n \n \n \n Get the source point. \n \n The mesh the point belongs to.\n The source point\n If point is null index.\n \n \n \n Get the target point. \n \n The mesh the point belongs to.\n The target point\n If point is null index.\n \n \n \n \n \n \n \n \n \n Are these edges equal.\n \n \n \n \n \n \n \n Are these edges not equal.\n \n \n \n \n \n \n \n Are these objects equal.\n \n \n \n \n \n \n Are these edges equal.\n \n \n \n \n \n \n The edges hahe code\n \n \n \n \n \n Enmerate all edges in this edge loop.\n \n The mesh the edges belong too.\n The next edge\n \n \n \n Enmerate all vertices in this edge loop.\n \n The mesh the edges belong too.\n The next vertex\n \n \n \n The vertices point.\n \n \n \n \n The vertices degree is how mang edges connect to it.\n \n \n \n \n The vertices index.\n \n \n \n \n The vertices edge\n \n \n \n \n A vertex where all components are null.\n \n \n \n \n \n \n \n \n \n \n Are these vertices equal.\n \n \n \n \n \n \n \n Are these vertices not equal.\n \n \n \n \n \n \n \n Are these objects equal.\n \n \n \n \n \n \n Are these vertices equal.\n \n \n \n \n \n \n The vertices hash code\n \n \n \n \n \n Enmerate all edges surrounding the vertex.\n \n The mesh the edges belong too.\n The next edge\n \n \n \n Generic nef polyhedron definition.\n A 3D Nef polyhedron is a subset of the 3-dimensional space that is the result of forming\n complements and intersections starting from a finite set H of 3-dimensional halfspaces.\n Nef polyhedra are closed under all binary set operations, i.e., intersection, union, \n difference, complement, and under the topological operations boundary, closure, and interior.\n \n The kernel type.\n \n \n \n creates a Nef polyhedron and initializes it to the empty \n set if plane == EMPTY and to the whole space if space == COMPLETE.\n \n The nef's space\n \n \n \n creates a Nef polyhedron containing the halfspace on the \n negative side of plane including plane if boundary==INCLUDED, \n excluding plane if boundary==EXCLUDED.\n \n The plane.\n The boundary.\n \n \n \n creates a Nef polyhedron, which represents the same point \n set as the polyhedral surface.\n \n The polyhedron\n \n \n \n Create from a pointer.\n \n The polyhedrons pointer.\n \n \n \n The nef polyhdron as a string.\n \n The nef polyhedron as a string.\n \n \n \n Return the intersection of nef and nef1.\n \n \n \n \n \n \n Return the union of nef and nef1.\n \n \n \n \n \n \n Return the difference between nef and nef1.\n \n \n \n \n \n \n Return the symmetric difference of nef and nef1.\n \n \n \n \n \n \n Returns the complement of nef. \n \n \n \n \n \n Returns the interior of nef. \n \n \n \n \n \n Returns the boundary of nef. \n \n \n \n \n \n Returns the closure of nef.\n \n \n \n \n \n Returns the regularization, i.e. the closure of the interior, of nef.\n \n \n \n \n \n Returns the MinkowskiSum.\n \n \n \n \n \n Converts nef into a Polyhedron.\n nef must be simple to convert.\n \n The result of the conversion.\n True if nef is simple and the conversion was successful.\n \n \n \n Converts nef into a surface mesh.\n nef must be simple to convert.\n \n The result of the conversion.\n True if nef is simple and the conversion was successful.\n \n \n \n Get a list of the nef volumes.\n \n Get a list of the nef volumes.\n \n \n \n The abstract nef polyhedra definition.\n \n \n \n \n Default constructor.\n \n \n \n \n creates a Nef polyhedron and initializes it to the empty \n set if plane == EMPTY and to the whole space if space == COMPLETE.\n \n The polyhedron kernel.\n The nef's space\n \n \n \n creates a Nef polyhedron containing the halfspace on the \n negative side of plane including plane if boundary==INCLUDED, \n excluding plane if boundary==EXCLUDED.\n \n The polyhedron kernel.\n The plane.\n The boundary.\n \n \n \n creates a Nef polyhedron, which represents the same point \n set as the polyhedral surface.\n \n The polyhedron kernel.\n The polyhedron\n \n \n \n Construct with a new kernel.\n \n The polyhedron kernel.\n The polyhedrons pointer.\n \n \n \n The polyhedron kernel.\n Contains the functions to the unmanaged CGAL polhedron.\n \n \n \n \n \n \n \n \n \n Return the number of halfedge pairs.\n \n \n \n \n Return the number of halfedges.\n \n \n \n \n Return the number of faces.\n \n \n \n \n Return the number of vertices.\n \n \n \n \n Return the number of volumes.\n \n \n \n \n Returns true, if nef is the empty point set.\n \n \n \n \n Rreturns true, if nef is a 2-manifold.\n \n \n \n \n Returns true, if nef is the complete 3D space.\n \n \n \n \n Make nef the empty set if space == EMPTY and the complete \n 3D space if space == COMPLETE.\n \n \n \n \n Checks the integrity of nef.\n \n \n \n \n \n Decompose the nef into convex volumes.\n \n \n \n \n Print the nef polyhedron into a string builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Should the input polygon be checked.\n Can disable for better performance if \n it is know all input if valid.\n \n \n \n \n Check if the mesh is valid.\n \n The mesh to check.\n \n \n \n Check if the mesh is valid.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid closed mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid closed mesh.\n \n The polygon to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n A polyhedral surface consists of vertices, edges, \n facets and an incidence relation on them.\n Each edge is represented by two halfedges with opposite orientations.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Construct from points and triangle indices.\n \n \n \n \n Construct from points and polygon indices.\n \n \n \n \n Create from a pointer.\n \n The meshs pointer.\n \n \n \n The polyhdron as a string.\n \n The mesh as a string.\n \n \n \n Create a deep copy of the mesh.\n \n A deep copy of the mesh.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Split the mesh into its unconnected components.\n \n Each unconnect component as a new mesh.\n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces polygon.\n Should the y coord of the points be used for the z coord.\n Thrown if the polygon is not simple.\n \n \n \n Create the dual mesh where each face becomes a vertex\n and each vertex becomes a face.\n Must be a valid closed mesh to create the dual.\n \n The duel mesh.\n Is thrown if the mesh is not a valid closed mesh.\n \n \n \n Convert to a surface mesh.\n \n The surface mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n The abstract polyhedra definition.\n \n \n \n \n Cached values found by running Update.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The mesh kernel.\n \n \n \n Construct with a new kernel.\n \n The mesh kernel.\n The meshs pointer.\n \n \n \n The mesh kernel.\n Contains the functions to the unmanaged CGAL polhedron.\n \n \n \n \n Number of vertices.\n \n \n \n \n Number of faces.\n \n \n \n \n Number of half edges.\n \n \n \n \n Number of border edges.\n Since each border edge of a polyhedral surface has exactly one \n border halfedge, this number is equal to size of border halfedges.\n \n \n \n \n Number of border halfedges.\n \n \n \n \n The current build stamp.\n \n \n \n \n Returns true if the polyhedral surface is combinatorially consistent.\n Must be a valid mesh to check many other properties.\n \n \n \n \n Returns true if there are no border edges.\n \n \n \n \n Returns true if all faces are triangles.\n \n \n \n \n Returns true if all faces are quads.\n \n \n \n \n Is the mesh a valid triangle mesh.\n \n \n \n \n Is the mesh a valid closed mesh.\n \n \n \n \n Is the mesh a valid closed triangle mesh.\n \n \n \n \n Has the update function been called.\n \n \n \n \n Mark th mesh as needing to be updated.\n \n \n \n \n Clear the mesh.\n \n \n \n \n Clear the index maps.\n The index maps are used to access the meshes elemnts by index.\n They are automaticaly created when a elements is accessed\n be a function requiring it.\n \n True to clear the vertex index map.\n True to clear the face index map.\n True to clear the edges index map.\n \n \n \n Clear the normal maps.\n \n True to clear the vertex normal map.\n True to clear the face normal map\n \n \n \n Builds the vertex and/or face index maps if needed.\n \n True to build the vertex index map.\n True to build the face index map.\n True to build the face index map.\n True to force the build even if already built.\n \n \n \n A tetrahedron is added to the polyhedral surface\n with its vertices initialized to p1, p2, p3, and p4.\n \n \n \n \n \n A edge in the tetrahdron.\n \n \n \n A triangle with border edges is added to the \n polyhedral surface with its vertices initialized to p1, p2, and p3.\n \n \n \n \n A edge in the triangle.\n \n \n \n Create a mesh from the points and indices.\n \n The meshes points.\n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Create a triangle mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a quad mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a mesh with quads and triangles.\n \n The meshes points.\n The point array length.\n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Create a mesh with riangles, quads, pentagons and hexagons.\n \n The meshs points.\n The length of the point array.\n The faces indices.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces points\n The point array length.\n Should the y coord of the points be used for the z coord.\n \n \n \n Get the triangle and quad indices.\n \n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Get the meshes triangles.\n \n The meshes triangles.\n The triangle array length.\n \n \n \n Get the meshes quads.\n \n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles and quads.\n \n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles, quads, pentagons and hexagons.\n \n The indices.\n \n \n \n Get the dual meshes triangles, quads, pentagons and hexagons.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The indices\n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n The points index.\n The vertices point.\n \n \n \n Get the vertices point.\n \n The vertex index in the mesh.\n The vertices point.\n If index is out of range.\n \n \n \n Get the point at the index\n and wrap around the polygon.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polygons last point.\n \n The points index.\n The point at the index.\n \n \n \n Get the vertices point but wraps the index.\n \n The vertex index in the mesh.\n The vertices point.\n \n \n \n Get the points in the mesh.\n \n The array to copy points into.\n The point array length.\n \n \n \n Set the point at the index.\n \n The points index\n The pointsam>\n If index is out of range.\n \n \n \n Set the points from a array.\n \n The point array.\n The point arrays length.\n \n \n \n Get a halfedges segment.\n \n The halfedges index.\n The segment.\n True if halfedge found.\n \n \n \n Get the segment.\n \n The segment index.\n The segment\n If segmentwith the index not found.\n \n \n \n Get a segment for each halfedge in the mesh.\n \n The segment array.\n The segment array length.\n \n \n \n Get the faces triangle. \n Presumes face is a triangle with no checks.\n \n The faces index.\n The faces triangle\n \n \n \n \n Get the triangle.\n \n The triangle index.\n The triangle\n If triangle with the index not found.\n \n \n \n Get a triangle for each face in the mesh.\n Presumes all faces are triangles with no checks.\n \n The trainagle array.\n The traingle arrays length.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the mesh vertex.\n \n The vertexs index.\n The vertexs\n If vertex with the index not found.\n \n \n \n Get the vertices in the mesh.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n True if the face was found.\n \n \n \n Get the mesh face.\n \n The faces index.\n The faces\n If face with the index not found.\n \n \n \n Get the faces in the mesh.\n \n The face array.\n The face array length.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n The halfedge.\n True if the halfedge was found.\n \n \n \n Get the mesh Halfedge.\n \n The Halfedges index.\n The Halfedges\n If Halfedge with the index not found.\n \n \n \n Get the halfedges in the mesh.\n \n The halfedge array.\n The halfedge array length.\n \n \n \n Count the number of triangles, quads and polygons in the mesh.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Count the number of triangles, quads and polygons in the dual mesh.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Get a centroid (the avergae face position) for each face in the mesh.\n \n The point array.\n The points arrays lemgth.\n \n \n \n Computes the vertex normals if needed.\n \n \n \n \n Computes the face normals if needed.\n \n \n \n \n Get the vertex normals.\n \n The normals array.\n The normals array length.\n \n \n \n Get the face normals.\n \n The normals array.\n The normals array length.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Make all faces triangles.\n \n \n \n \n sorts halfedges such that the non-border edges precede the border edges.\n For each border edge the halfedge iterator will reference the halfedge \n incident to the facet right before the halfedge incident to the hole.\n \n \n \n \n returns true if the border halfedges are in normalized representation, \n which is when enumerating all halfedges with the iterator: \n The non-border edges precede the border edges and for border edges,\n the second halfedge is the border halfedge.\n \n \n \n \n \n Find what side of the mesh the lies in.\n \n The point to check.\n ON_BOUNDED_SIDE if point inside mesh, \n ON_UNBOUNDED_SIDE if point not inside, \n ON_BOUNDARY if point is on the surface.\n \n \n \n Does the mesh contain the point.\n \n The point.\n If point is on the boundary does it count a being contained.\n True if the poly contains the point\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n Locate the face hit by the ray.\n \n The ray.\n The hit face.\n True if the ray hit a face.\n \n \n \n Locate the vertex hit by the ray.\n \n The ray.\n The distance the vertex has to be within hit point.\n The hit vertex.\n True if the ray hit a vertex.\n \n \n \n Locate the edge hit by the ray.\n \n The ray.\n The distance the edge has to be within hit point.\n The hit edge.\n True if the ray hit a edge.\n \n \n \n Tests if a set of faces of a triangulated surface mesh self-intersects.\n Must be a triangle mesh.\n \n True/Fasle if a valid triangle polyhedra,or UNDETERMINED if not.\n \n \n \n returns true if the polyhedral surface is combinatorially consistent.\n For level == 1 the normalization of the border edges is checked too.\n This method checks that each face is at least a triangle and that the\n two incident facets of a non-border edge are distinct.\n \n \n \n \n \n Computes the bounding box.\n \n The bounding box.\n \n \n \n Computes the area of a range of faces\n of a given triangulated surface mesh.\n \n The area or 0 if poyhedron is not valid triangle mesh.\n \n \n \n computes the centroid of a volume bounded \n by a closed triangulated surface mesh.\n \n The centroid or 0 if poyhedron is not valid.\n \n \n \n Computes the volume of the domain bounded by a \n closed triangulated surface mesh.\n \n The volume or 0 if poyhedron is not valid closed triangle mesh.\n \n \n \n Returns true if there are no border edges.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all vertices have exactly two incident edges.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all vertices have exactly three incident edges.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all faces are triangles.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all faces are quads.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Indicates if the mesh bounds a volume.\n Must be a closed and triangulated.\n \n True/Fasle if a valid triangle closed polyhedra,or UNDETERMINED if not.\n \n \n \n Builds the aabb tree used for location.\n Tree will be automatically built if need so not \n actually necessary to call this function.\n \n \n \n \n Will delete the aabb tree.\n \n \n \n \n Returns true if there exists a face of this poly and \n a face of other poly which intersect, and false otherwise.\n Must be a triangle mesh\n \n The other triangle poly.\n If test_bounded_sides is set to true, \n the overlap of bounded sides are tested as well. In that case, the meshes must be closed.\n True/Fasle if a valid triangle closed polyhedra,or UNDETERMINED if not.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Read data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Write data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Return all the points in the mesh in a array.\n \n The array.\n \n \n \n Return all the points in the mesh in a list.\n \n The list.\n \n \n \n https://doc.cgal.org/latest/Polyhedron/classCGAL_1_1Polyhedron__3.html#a73119c0c90bf8612da003305af25a52a\n creates a new facet within the hole incident to h and g by connecting the \n vertex denoted by g with the vertex denoted by h with a new halfedge and \n filling this separated part of the hole with a new facet, such that the \n new facet is incident to g.\n \n Precondition\n h->is_border(), g->is_border(), h != g, h->next() != g, \n and g can be reached along the same hole starting with h.\n \n a halfedge index\n a halfedge index\n Returns the halfedge of the new edge that is incident to the new facet.\n \n \n \n creates a new facet within the hole incident to h and g by connecting the \n tip of g with the tip of h with two new halfedges and a new vertex and \n filling this separated part of the hole with a new facet, such that the \n new facet is incident to g.\n \n Precondition\n h->is_border(), g->is_border(), h != g, and g can be reached along the same hole starting with h.\n \n a halfedge index\n a halfedge index\n Returns the halfedge of the new edge that is incident to the new facet and the new vertex.\n \n \n \n barycentric triangulation of h->facet().\n Creates a new vertex, a copy of h->vertex(), and connects it to each vertex incident \n to h->facet() splitting h->facet() into triangles.h remains incident to the original \n facet, all other triangles are copies of this facet.\n Precondition\n h is not a border halfedge.\n \n a halfedge index\n Returns the halfedge h->next() \n after the operation, i.e., a halfedge pointing to the new vertex.The time is \n proportional to the size of the facet.\n \n \n \n reverses create_center_vertex().\n Erases the vertex pointed to by g and all incident halfedges thereby merging all \n incident facets.Only g->facet() remains. The neighborhood of g->vertex() may not \n be triangulated, it can have larger facets.\n Precondition\n None of the incident facets of g->vertex() is a hole. There are at least two distinct facets incident to the facets that are incident to g->vertex(). (This prevents the operation from collapsing a volume into two facets glued together with opposite orientations, such as would happen with any vertex of a tetrahedron.)\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns the halfedge g->prev(). \n Thus, the invariant h == erase_center_vertex(create_center_vertex(h)) \n holds if h is not a border halfedge.The time is proportional to the sum of the size of all incident facets.\n \n \n \n removes the incident facet of h and changes all halfedges incident to the facet \n into border edges or removes them from the polyhedral surface if they were already border edges.\n If this creates isolated vertices they get removed as well.See make_hole(h) for a more specialized variant.\n Precondition\n h->is_border() == false.\n Supports_removal must be CGAL::Tag_true\n \n a halfedge index\n \n \n \n \n Erase a facet.\n \n a halfedge index\n returns a range of handles over the facets.\n \n \n \n fills a hole with a newly created facet.\n Makes all border halfedges of the hole denoted \n by h incident to the new facet.Returns h.\n Precondition\n h.is_border().\n \n a halfedge index\n \n \n \n \n performs an edge flip.\n \n Precondition\n h != Halfedge_handle() and both facets incident to h are triangles.\n \n a halfedge index\n It returns h after rotating the edge h one vertex in the direction of the face orientation.\n \n \n \n joins the two facets incident to h.\n The facet incident to h->opposite() gets removed.Both facets might be holes. \n \n Precondition\n The degree of both vertices incident to h is at least three(no antennas).\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns the predecessor of h around the facet. The invariant join_facet(split_facet(h, g)) \n returns h and keeps the polyhedron unchanged.The time is proportional to the size of \n the facet removed and the time to compute h->prev().\n \n \n \n glues the boundary of the two facets denoted by h and g together and returns h.\n Both facets and the vertices along the facet denoted by g gets removed.Both facets may be holes.\n The invariant join_loop(h, split_loop(h, i, j)) \n Precondition\n The facets denoted by h and g are different and have equal degree(i.e., number of edges).\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n a halfedge index\n returns h and keeps the polyhedron unchanged.\n \n \n \n joins the two vertices incident to h.\n The vertex denoted by h->opposite() gets removed.\n Precondition\n The size of both facets incident to h is at least four(no multi-edges).\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns the predecessor of h around the vertex, i.e.,\n h->opposite()->prev(). The invariant join_vertex(split_vertex(h, g)) \n returns h and keeps the polyhedron unchanged.The time is proportional \n to the degree of the vertex removed and the time to compute h->prev() and h->opposite()->prev().\n \n \n \n removes the incident facet of h and changes all halfedges incident to the facet into border edges.\n \n Precondition\n None of the incident halfedges of the facet is a border edge.\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns h.See erase_facet(h) for a more generalized variant.\n \n \n \n splits the halfedge h into two halfedges inserting a new vertex that is a copy of h->opposite()->vertex().\n Is equivalent to split_vertex(h->prev(), h->opposite())->opposite(). The call of prev() can make this method \n slower than a direct call of split_vertex() if the previous halfedge is already known and computing \n it would be costly when the halfedge data structure does not support the prev() member function.\n \n \n a halfedge index\n Returns the new halfedge now pointing to the inserted vertex.The new halfedge is followed \n by the old halfedge, i.e., hnew->next() == h.\n \n \n \n splits the facet incident to h and g into two facets with a new diagonal between \n the two vertices denoted by h and g respectively.\n The second(new) facet is a copy of the first facet.\n Precondition\n h and g are incident to the same facet.h != g (no loops). h->next() != g and g->next() != h (no multi-edges).\n \n a halfedge index\n a halfedge index\n Returns h->next() after the\n operation, i.e., the new diagonal.The new face is to the right of the new diagonal,\n the old face is to the left.The time is proportional to the distance from h to g around the facet.\n \n \n \n \n cuts the polyhedron into two parts along the cycle (h,i,j) (edge j runs on the backside of the three dimensional figure above).\n Three new vertices(one copy for each vertex in the cycle) and three new halfedges(one copy for each halfedge in the cycle), \n and two new triangles are created.h,i,j will be incident to the first new triangle.\n Precondition\n h, i, j denote distinct, consecutive vertices of the polyhedron and form a cycle: i.e., h->vertex() == i->opposite()->vertex(),\n … , j->vertex() == h->opposite()->vertex(). The six facets incident to(h, i, j) are all distinct.\n \n a halfedge index\n a halfedge index\n a halfedge index\n The return value will be the halfedge \n incident to the second new triangle which is the copy of h-opposite().\n \n \n \n splits the vertex incident to h and g into two vertices, the old vertex remains and a\n new copy is created, and connects them with a new edge.\n Let hnew be h->next()->opposite() after the split, i.e., a halfedge of the new edge.\n The split regroups the halfedges around the two vertices.The halfedge sequence hnew,\n g->next()->opposite(), … , h remains around the old vertex, while the halfedge \n sequence hnew->opposite(), h->next()->opposite() (before the split), … , g is \n regrouped around the new vertex.\n Precondition\n h and g are incident to the same vertex. h != g (antennas are not allowed).\n \n a halfedge index\n a halfedge index\n The split returns hnew, i.e., the new halfedge \n incident to the old vertex.The time is proportional to the distance from h to \n g around the vertex.\n \n \n \n Update the mesh if needed.\n \n \n \n \n Print the mesh into a string builder.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n This class is a data structure that can be used as halfedge data structure.\n It is an alternative to the classes Polyhedron3.The main difference is that it is indexed based and not pointer based, \n and that the mechanism for adding information to vertices, halfedges, edges, and faces is much simpler.\n When elements are removed, they are only marked as removed, and a garbage collection function must be called to really remove them.\n \n The kernel type\n \n \n \n Default constructor.\n \n \n \n \n Construct from points and triangle indices.\n \n \n \n \n Construct from points and polygon indices.\n \n \n \n \n Create from a pointer.\n \n The surface meshes pointer.\n \n \n \n The mesh as a string.\n \n The mesh as a string.\n \n \n \n Create a deep copy of the mesh.\n \n The deep copy.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Split the mesh into its unconnected components.\n \n Each unconnect component as a new mesh.\n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Copy the other mesh to this one.\n \n \n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces polygon.\n Should the y coord of the points be used for the z coord.\n Thrown if the polygon is not simple.\n \n \n \n Convert to a polyhedron mesh.\n \n The polyhedron mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n The surface mesh abstract base class.\n \n \n \n \n Cached values found by running Update.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct mesh with the kernel.\n \n The kernel\n \n \n \n Construct with a new kernel.\n \n The surface meshes kernel.\n The surface meshes pointer.\n \n \n \n The meshes kernel type.\n \n \n \n \n The number of vertices in the mesh.\n \n \n \n \n The number of half edges in the mesh.\n \n \n \n \n The number of edges in the mesh.\n \n \n \n \n The number of faces in the mesh.\n \n \n \n \n The number of border edges.\n \n \n \n \n The current build stamp.\n \n \n \n \n The number of vertices currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of vertices marked to be removed.\n \n \n \n The number of halfedges currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of half edges marked to be removed.\n \n \n \n The number of edges currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of edges marked to be removed.\n \n \n \n The number of faces currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of face marked to be removed.\n \n \n \n Returns true if the meshl surface is combinatorially consistent.\n Must be a valid mesh to check many other properties.\n \n \n \n \n Returns true if there are no border edges.\n \n \n \n \n Returns true if all faces are triangles.\n \n \n \n \n Returns true if all faces are quads.\n \n \n \n \n Is the mesh a valid triangle mesh.\n \n \n \n \n Is the mesh a valid closed mesh.\n \n \n \n \n Is the mesh a valid closed triangle mesh.\n \n \n \n \n Has the update function been called.\n \n \n \n \n Mark the mesh as needing to be updated.\n \n \n \n \n Clear the mesh.\n \n \n \n \n Clear the index maps.\n The index maps are used to access the meshes elemnts by index.\n They are automaticaly created when a elements is accessed\n be a function requiring it.\n \n True to clear the vertex index map.\n True to clear the face index map.\n True to clear the edges index map.\n True to clear the halfedges index map.\n \n \n \n Clear the normal maps.\n \n True to clear the vertex normal map.\n True to clear the face normal map\n \n \n \n Clear the property maps.\n \n \n \n \n Build the index maps.\n The index maps are used to access the meshes elemnts by index.\n They are automaticaly created when a elements is accessed\n be a function requiring it but can be create ahead of time.\n \n True to build the vertex index maps.\n True to build the face index maps.\n True to build the edge index maps.\n True to build the halfedge index maps.\n The index maps wont be build if the mesh knows they are already built and upto date.\n Setting force to true will build them always.\n \n \n \n \n \n \n \n \n \n \n \n \n \n Adds a vertex to the mesh.\n \n The vertices position\n The vertices index in the mesh.\n \n \n \n Adds a edge between the two vertices.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the edge in the mesh.\n \n \n \n Adds a triangle face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Adds a quad face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Adds a pentagon face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Adds a hexagon face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Add a polygon face to the mesh.\n \n The indices of the points in the mesm.\n The indices array length.\n The index of the face in the mesh.\n \n \n \n Checks if any vertices, halfedges, edges, or faces are marked as removed.\n \n \n \n \n \n Really removes vertices, halfedges, edges, and faces which are marked removed.\n By garbage collecting elements get new indices. In case you store indices in an \n auxiliary data structure or in a property these indices are potentially no \n longer refering to the right elements.\n \n \n \n \n Controls the recycling or not of simplices previously marked as removed \n upon addition of new elements.\n When set to true (default value), new elements are first picked in the \n garbage(if any) while if set to false only new elements are created.\n \n \n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n \n \n \n \n \n Get the vertices point.\n \n The vertex index in the mesh.\n The vertices point.\n If index is out of range.\n \n \n \n Get the points in the mesh.\n \n The array to copy points into.\n The point array length.\n \n \n \n Set the point at the index.\n \n The points index\n The pointsam>\n If index is out of range.\n \n \n \n Set the points from a array.\n \n The point array.\n The point arrays length.\n \n \n \n Get a halfedges segment.\n \n The halfedges index.\n The segment.\n True if halfedge found.\n \n \n \n Get a segment for each halfedge in the mesh.\n \n The segment array.\n The segment array length.\n \n \n \n Get the faces triangle. \n Presumes face is a triangle with no checks.\n \n The faces index.\n The faces triangle\n \n \n \n \n Get a triangle for each face in the mesh.\n Presumes all faces are triangles with no checks.\n \n The trainagle array.\n The traingle arrays length.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n \n \n \n Get the vertices in the mesh.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n True if the face was found.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n \n \n \n Get the faces in the mesh.\n \n The face array.\n The face array length.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n The halfedge.\n True if the halfedge was found.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n THe healfedge.\n \n \n \n Get the halfedges in the mesh.\n \n The halfedge array.\n The halfedge array length.\n \n \n \n Returns the number of incident halfedges of vertex.\n \n The index of the vertex in the mesh.\n Returns the number of incident halfedges of vertex.\n \n \n \n Returns the number of incident halfedges of face.\n \n The index of the face in the mesh.\n Returns the number of incident halfedges of face.\n \n \n \n Returns whether vertex is isolated.\n \n The index of the vertex in the mesh.\n Returns whether vertex is isolated.\n \n \n \n Returns whether vertex is a border vertex.\n If the data contained in the Surface_mesh is not\n a 2-manifold, then this operation is not \n guaranteed to return the right result.\n \n he index of the vertex in the mesh.\n With the default value for \n check_all_incident_halfedges the function iteratates over the incident \n halfedges. With check_all_incident_halfedges == false the function \n returns true, if the incident halfedge associated to vertex is a\n border halfedge, or if the vertex is isolated.\n Returns whether vertex is a border vertex.\n \n \n \n Returns whether edge is a border edge, i.e., if any of its two halfedges is a border halfedge.\n \n The index of the edge in the mesh.\n Returns whether edge is a border edge.\n \n \n \n Returns the next halfedge within the incident face.\n \n The index of the halfedge in the mesh.\n Returns the next halfedge within the incident face.\n \n \n \n Returns the previous halfedge within the incident face.\n \n The index of the halfedge in the mesh.\n Returns the previous halfedge within the incident face.\n \n \n \n Returns the opposite halfedge of halfedge.\n \n The index of the halfedge in the mesh.\n Returns the opposite halfedge of halfedge.\n \n \n \n Returns the vertex the halfedge emanates from.\n \n The index of the halfedge in the mesh.\n Returns the vertex the halfedge emanates from.\n \n \n \n Returns the vertex the halfedge points to.\n \n The index of the halfedge in the mesh.\n Returns the vertex the halfedge points to.\n \n \n \n Removes vertex from the halfedge data structure without adjusting anything.\n \n The index of the vertex in the mesh.\n True if face removed.\n \n \n \n Removes the two halfedges corresponding to edge from the halfedge\n data structure without adjusting anything.\n \n The index of the edge in the mesh.\n True if face removed.\n \n \n \n Removes face from the halfedge data structure without adjusting anything.\n \n The index of the face in the mesh.\n True if face removed.\n \n \n \n Has this vertex been marked to be removed.\n \n The vertices index in the mesh.\n Has this vertex been marked to be removed.\n \n \n \n Has this face been marked to be removed.\n \n The faces index in the mesh.\n Has this face been marked to be removed.\n \n \n \n Has this halfedge been marked to be removed.\n \n The halfedge index in the mesh.\n Has this halfedge been marked to be removed.\n \n \n \n Has this edge been marked to be removed.\n \n The edges index in the mesh.\n Has this edge been marked to be removed.\n \n \n \n Performs a validity check on a single vertex.\n \n The index of the vertex in the mesh.\n True if valid.\n \n \n \n Performs a validity check on a single edge.\n \n The index of the edge in the mesh.\n True if valid.\n \n \n \n Performs a validity check on a single halfedge.\n \n The index of the halfedge in the mesh.\n True if valid.\n \n \n \n Performs a validity check on a single face.\n \n The index of the face in the mesh.\n True if valid.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Create a mesh from the points and indices.\n \n The meshes points.\n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Create a triangle mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a quad mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a mesh with quads and triangles.\n \n The meshes points.\n The point array length.\n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Create a mesh with riangles, quads, pentagons and hexagons.\n \n The meshs points.\n The length of the point array.\n The faces indices.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces points\n The paoint array length.\n Should the y coord of the points be used for the z coord.\n \n \n \n Get the triangle and quad indices.\n \n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Get the meshes triangles.\n \n The meshes triangles.\n The triangle array length.\n \n \n \n Get the meshes quads.\n \n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles and quads.\n \n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles, quads, pentagons and hexagons.\n \n The indices.\n \n \n \n Whether v is a border vertex.\n \n The vertices index.\n With the default value for \n check_all_incident_halfedges the function iteratates over the incident halfedges. \n With check_all_incident_halfedges == false the function returns true, \n if the incident halfedge associated to vertex v is a border halfedge, \n or if the vertex is isolated.\n Whether v is a border vertex.\n \n \n \n Whether half edge is a border halfege, that is if its incident face is null.\n \n The halfedges index.\n Whether half edge is a border halfege.\n \n \n \n Whether e is a border edge, i.e., if any of its two halfedges is a border halfedge.\n \n The edges index.\n Whether e is a border edge.\n \n \n \n Count the number of triangles, quads and polygons in the mesh.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Count the number of triangles, quads and polygons in the dual mesh.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Build the aabb tree.\n \n \n \n \n Release the aabb tree.\n \n \n \n \n Find the bounding box of the meshes points.\n \n \n \n \n \n Read the mesh from a off file format.\n \n The files name.\n \n \n \n Write the mesh to off file format.\n \n The files name.\n \n \n \n Make all faces triangles.\n \n \n \n \n Tests if a set of faces of a triangulated surface mesh self-intersects.\n Must be a triangle mesh.\n \n True/Fasle if a valid triangle mesh,or UNDETERMINED if not.\n \n \n \n Perform an expensive validity check on the data structure.\n \n If the mesh is valid.\n \n \n \n Find if all the faces in the mesh are triangles.\n \n True if all the faces in the mesh are triangles, Will be undetermined if no a valid mesh.\n \n \n \n Find if all the faces in the mesh are quads.\n \n True if all the faces in the mesh are quads, Will be undetermined if no a valid mesh.\n \n \n \n Find if the mesh is closed, ie has no border edges.\n \n \n \n \n Computes the area of a range of faces\n of a given triangulated surface mesh.\n \n The area or 0 if mesh is not valid triangle mesh.\n \n \n \n computes the centroid of a volume bounded \n by a closed triangulated surface mesh.\n \n The centroid or 0 if mesh is not valid.\n \n \n \n Computes the volume of the domain bounded by a \n closed triangulated surface mesh.\n \n The volume or 0 if mesh is not valid closed triangle mesh.\n \n \n \n Indicates if the mesh bounds a volume.\n Must be a closed and triangulated.\n \n True/Fasle if a valid triangle closed mesh,or UNDETERMINED if not.\n \n \n \n Find what side of the mesh the lies in.\n \n The point to check.\n ON_BOUNDED_SIDE if point inside mesh, \n ON_UNBOUNDED_SIDE if point not inside, \n ON_BOUNDARY if point is on the surface.\n \n \n \n Does the mesh contain the point.\n \n The point.\n If point is on the boundary does it count a being contained.\n True if the poly contains the point\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n Locate the face hit by the ray.\n \n The ray.\n The hit face.\n True if the ray hit a face.\n \n \n \n Locate the vertex hit by the ray.\n \n The ray.\n The distance the vertex has to be within hit point.\n The hit vertex.\n True if the ray hit a vertex.\n \n \n \n Locate the edge hit by the ray.\n \n The ray.\n The distance the edge has to be within hit point.\n The hit edge.\n True if the ray hit a edge.\n \n \n \n Returns true if there exists a face of this poly and \n a face of other mesh which intersect, and false otherwise.\n Must be a triangle mesh\n \n The other triangle poly.\n If test_bounded_sides is set to true, \n the overlap of bounded sides are tested as well. In that case, the meshes must be closed.\n True/Fasle if a valid triangle closed mesh,or UNDETERMINED if not.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Get a centroid (the avergae face position) for each face in the mesh.\n \n The point array.\n The points arrays lemgth.\n \n \n \n Compute the vertex normal map.\n Will only be computed if mesh has\n changed since last computation or \n no current nomral maps have been computed.\n \n \n \n \n Compute the face normal map.\n Will only be computed if mesh has\n changed since last computation or \n no current nomral maps have been computed.\n \n \n \n \n Get the vertex normals.\n Will be compute if they have not aready.\n \n The normal map array.\n The normal maps array length.\n \n \n \n Get the face normals.\n Will be compute if they have not aready.\n \n The normal map array.\n The normal maps array length.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Return all the points in the mesh in a array.\n \n The array.\n \n \n \n Return all the points in the mesh in a list.\n \n The list.\n \n \n \n Update the mesh if needed.\n \n \n \n \n Print the mesh into a string builder.\n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Generic polyline definition.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Create from a set of points.\n \n The polylines points.\n \n \n \n Create from a pointer.\n \n The polylines pointer.\n \n \n \n The polyline as a string.\n \n The polyline as a string.\n \n \n \n Copy the polyline.\n \n The copied polyline.\n \n \n \n Create a polygon from the line.\n \n Threshold for the firat and last points being equal.\n The polygon.\n \n \n \n The abstract polyline definition.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The points to construct from.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The polylines pointer.\n \n \n \n The number of points in the polyline.\n \n \n \n \n The capacity of the point array.\n \n \n \n \n Get the first point.\n \n \n \n \n Get the last point.\n \n \n \n \n The polylines kernel.\n Contains the functions to the unmanaged CGAL polyline.\n \n \n \n \n Array accessor for the polyline.\n Getting a point clamps to the last point in polyline.\n \n \n \n \n \n \n Clear the polyline of all points.\n \n \n \n \n Shrink the capacity to match the point count.\n \n \n \n \n Resize the point array.\n New elements will default to zero.\n \n \n \n \n \n Reverse the polints in the line.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index\n \n \n \n Remove a range of points from the array.\n \n The starting index\n The number of points to remove.\n \n \n \n Remove the last point.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index.\n The point to insert.\n \n \n \n Remove a range of points from the array.\n \n The points to insert.\n The starting index.\n The number of points to insert.\n \n \n \n Add the point to the end of the poylline.\n \n The point to add.\n \n \n \n Does the first and last point match.\n \n The distance threshold that counts as match.\n \n \n \n \n Get the point a the index.\n \n The points index to get.\n The point at index.\n \n \n \n Get the point at the index\n and wrap around the polyline.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polylines last point.\n \n The points index.\n The point at the index.\n \n \n \n Get all the points in the polyline.\n \n The point array to copy the data into.\n The array length.\n \n \n \n Get all the polyline points.\n \n The list to copy the data into.\n \n \n \n Get all the polyline segments.\n \n The segment array to copy the data into.\n The array length.\n \n \n \n Set the points at the index.\n \n The points index.\n The points value.\n \n \n \n Set the points from the array.\n If the array is larger than the polyline then \n the new points will be appended to end of polyline.\n \n The points array.\n The array length.\n \n \n \n Finds the length of the polyline.\n \n \n \n \n \n Finds the square length of the polyline.\n \n \n \n \n \n Translate the polyline.\n \n The amount to translate.\n \n \n \n Rotate the polyline.\n \n The amount to rotate in radians.\n \n \n \n Scale the polyline.\n \n The amount to scale.\n \n \n \n Transform the polyline with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Return all the points in the polyline in a array.\n \n The array.\n \n \n \n Return all the points in the polyline in a list.\n \n The list.\n \n \n \n Convert the polyline to a new polyline with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polline.\n \n \n \n Print the polyline into a styring builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Generic polyline definition.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Create from a set of points.\n \n The polylines points.\n \n \n \n Create from a pointer.\n \n The polylines pointer.\n \n \n \n The polyline as a string.\n \n The polyline as a string.\n \n \n \n Copy the polyline.\n \n The copied polyline.\n \n \n \n The abstract polyline definition.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The points to construct from.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The polylines pointer.\n \n \n \n The number of points in the polyline.\n \n \n \n \n The capacity of the point array.\n \n \n \n \n Get the first point.\n \n \n \n \n Get the last point.\n \n \n \n \n The polylines kernel.\n Contains the functions to the unmanaged CGAL polyline.\n \n \n \n \n Array accessor for the polyline.\n Getting a point clamps to the last point in polyline.\n \n \n \n \n \n \n Clear the polyline of all points.\n \n \n \n \n Shrink the capacity to match the point count.\n \n \n \n \n Resize the point array.\n New elements will default to zero.\n \n \n \n \n \n Reverse the polints in the line.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index\n \n \n \n Remove a range of points from the array.\n \n The starting index\n The number of points to remove.\n \n \n \n Remove the last point.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index.\n The point to insert.\n \n \n \n Remove a range of points from the array.\n \n The points to insert.\n The starting index.\n The number of points to insert.\n \n \n \n Add the point to the end of the poylline.\n \n The point to add.\n \n \n \n Does the first and last point match.\n \n The distance threshold that counts as match.\n \n \n \n \n Get the point a the index.\n \n The points index to get.\n The point at index.\n \n \n \n Get the point at the index\n and wrap around the polyline.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polylines last point.\n \n The points index.\n The point at the index.\n \n \n \n Get all the points in the polyline.\n \n The point array to copy the data into.\n The array length.\n \n \n \n Get all the polyline points.\n \n The list to copy the data into.\n \n \n \n Get all the polyline segments.\n \n The segment array to copy the data into.\n The array length.\n \n \n \n Set the points at the index.\n \n The points index.\n The points value.\n \n \n \n Set the points from the array.\n If the array is larger than the polyline then \n the new points will be appended to end of polyline.\n \n The points array.\n The array length.\n \n \n \n Finds the length of the polyline.\n \n \n \n \n \n Finds the square length of the polyline.\n \n \n \n \n \n Translate each point in the polyline.\n \n The amount to translate.\n \n \n \n Rotate each point in the polyline.\n \n The amount to rotate.\n \n \n \n Scale each point in the polyline.\n \n The amount to scale.\n \n \n \n Transform each point in the polyline.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Return all the points in the polyline in a array.\n \n The array.\n \n \n \n Return all the points in the polyline in a list.\n \n The list.\n \n \n \n Convert the polyline to a new polyline with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polline.\n \n \n \n Print the polyline into a styring builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n The heat method is an algorithm that solves the single- or multiple-source shortest \n path problem by returning an approximation of the geodesic distance for all vertices\n of a triangle mesh to the closest vertex in a given set of source vertices. \n The geodesic distance between two vertices of a mesh is the distance when walking \n on the surface, potentially through the interior of faces. Two vertices that are \n close in 3D space may be far away on the surface.\n \n \n \n \n \n Create a static instance.\n \n \n \n \n Create a new instance.\n \n \n \n \n Create a new instance from a existing pointer to a unmanaged object.\n \n The unmanaged objects pointer.\n \n \n \n \n \n \n \n \n \n Find the distances for each vertex in the mesh to the vertex at the provided index.\n \n The mesh containing the vertices.\n The vertices index to find the distances to.\n The distances for each vertex in the mesh.\n Should the intrinsitic delaunay triangulation be used. \n This will improve the results for meshes that have bad triangle quality.\n The maximum distance value.\n \n \n \n Find the distances for each vertex in the mesh to the vertex at the provided index.\n \n The mesh containing the vertices.\n The vertices index to find the distances to.\n The distances for each vertex in the mesh.\n This will improve the results for meshes that have bad triangle quality.\n The maximum distance value.\n \n \n \n \n \n \n \n \n Create a new instance.\n \n \n \n \n \n Create a new instance from a existing pointer to a unmanaged object.\n \n \n The unmanaged objects pointer.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Returns the number of unconnect components in the mesh.\n \n A valid mesh.\n Returns the number of unconnect components in the mesh.\n \n \n \n Returns a list of face indices that are part of the same component as the provided face index.\n \n A valid mesh.\n The faces index in the mesh.\n A list of face indices that are part of the same component as the provided face index.\n \n \n \n Returns a list of face indices that are part of the same component as the provided face index.\n \n A valid mesh.\n The faces index in the mesh.\n A list of face indices that are part of the same component as the provided face index.\n \n \n \n Split each component in the mesh into individual meshes.\n \n A valid mesh.\n The split meshes.\n \n \n \n Split each component in the mesh into individual meshes.\n \n A valid mesh.\n The split meshes.\n \n \n \n Removes connected components with less than a given number of faces.\n \n A valid mesh.\n The number of faces a component must have so that it is kept\n The number of components removed.\n \n \n \n Removes connected components with less than a given number of faces.\n \n A valid mesh.\n The number of faces a component must have so that it is kept\n The number of components removed.\n \n \n \n Removes the small connected components and all isolated vertices.\n \n A valid mesh.\n Keep this number of the largest connected components.\n The number of components removed.\n \n \n \n Removes the small connected components and all isolated vertices.\n \n A valid mesh.\n Keep this number of the largest connected components.\n The number of components removed.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Detects the edges that are considered to be sharp with respect to the given angle bound.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The halfedge indices of the edges that count as sharp.\n \n \n \n Detects the edges that are considered to be sharp with respect to the given angle bound.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The halfedge indices of the edges that count as sharp.\n \n \n \n Find the min, max and average edge lengths in the mesh.\n \n A valid mesh.\n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh.\n \n A valid mesh.\n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh.\n \n A valid mesh.\n The min, max and average face areas in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh.\n \n A valid mesh.\n The min, max and average face areas in the mesh.\n \n \n \n Detects the sharp edges of mesh according to angle as the DetectSharpEdges function does. \n The sharp edges are then used to define a segmentation of a mesh, that is done by computing \n a surface patch id for each face.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The halfedge indices of the edges that count as sharp.\n The face indices for each patch found.\n \n \n \n Detects the sharp edges of pmesh according to angle as the DetectSharpEdges function does. \n The sharp edges are then used to define a segmentation of a mesh, that is done by computing \n a surface patch id for each face.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The face indices for each patch found.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Find a random point on mesh surface.\n \n The mesh.\n A random point on mesh surface.\n \n \n \n Find a random point on mesh surface.\n \n The mesh.\n A random point on mesh surface.\n \n \n \n Find the face the ray intersects with.\n \n The mesh.\n Th ray.\n The hit result with theface index, hit point and the barycentric coords.\n \n \n \n Find the face the ray intersects with.\n \n The mesh.\n Th ray.\n The hit result with theface index, hit point and the barycentric coords.\n \n \n \n Find the closest face to the point.\n \n The mesh.\n Th point.\n The hit result with the face index, closest point and the barycentric coords.\n \n \n \n Find the closest face to the point.\n \n The mesh.\n Th point.\n The hit result with the face index, closest point and the barycentric coords.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Fills output with a closed mesh bounding the volume swept by input when translating its vertices by dir.\n The mesh is oriented so that the faces corresponding to input in output have the same orientation.\n \n The a valid closed mesh.\n The direction vector.\n The extuded mesh.\n \n \n \n Fills output with a closed mesh bounding the volume swept by input when translating its vertices by dir.\n The mesh is oriented so that the faces corresponding to input in output have the same orientation.\n \n The a valid closed mesh.\n The direction vector.\n The extuded mesh.\n \n \n \n Fairs a region on a triangle mesh based on a ring of k vertices from the index vertex.\n The points of the selected vertices are relocated to yield an as-smooth-as-possible surface patch,\n based on solving a linear bi-Laplacian system with boundary constraints\n The region described by vertices might contain multiple disconnected components.\n Note that the mesh connectivity is not altered in any way, only vertex locations get updated.\n Fairing might fail if fixed vertices, which are used as boundary conditions, \n do not suffice to solve constructed linear system.\n Note that if the vertex range to which fairing is applied contains all the vertices of the triangle mesh, \n fairing does not fail, but the mesh gets shrinked to the origin.\n \n A valid triangle mesh.\n The vertex index in the mesh to start hthe k ring region from.\n The number of vertics to expand the region to.\n If the fairing was successfully run.\n \n \n \n Refines a triangle mesh\n \n A valid triangle mesh.\n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices added.\n \n \n \n Refines a triangle mesh\n \n A valid triangle mesh.\n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices added.\n \n \n \n Remeshes a triangulated region of a meshgon mesh.\n This operation sequentially performs edge splits, edge collapses, edge flips, \n tangential relaxation and projection to the initial surface to generate \n a smooth mesh with a prescribed edge length.\n \n A valid triangle mesh.\n The number of times to perform the remeshing.\n the edge length that is targeted in the remeshed patch. \n If 0 is passed then only the edge-flip, tangential relaxation, and projection steps will be done.\n The number of new vertices added.\n \n \n \n Remeshes a triangulated region of a meshgon mesh.\n This operation sequentially performs edge splits, edge collapses, edge flips, \n tangential relaxation and projection to the initial surface to generate \n a smooth mesh with a prescribed edge length.\n \n A valid triangle mesh.\n The number of times to perform the remeshing.\n the edge length that is targeted in the remeshed patch. \n If 0 is passed then only the edge-flip, tangential relaxation, and projection steps will be done.\n The number of new vertices added.\n \n \n \n randomly perturbs the locations of vertices of a triangulated surface mesh.\n By default, the vertices are re-projected onto the input surface after \n perturbation.Note that no geometric checks are done after the perturbation \n (face orientation might become incorrect and self-intersections might be introduced).\n \n A mesh.\n The maximun amount a vertex will be pertured. Must be greater tha 0.\n \n \n \n randomly perturbs the locations of vertices of a triangulated surface mesh.\n By default, the vertices are re-projected onto the input surface after \n perturbation.Note that no geometric checks are done after the perturbation \n (face orientation might become incorrect and self-intersections might be introduced).\n \n A mesh.\n The maximun amount a vertex will be pertured. Must be greater tha 0.\n \n \n \n Smooths a triangulated mesh.\n This function attempts to make the triangle angle and area distributions as uniform \n as possible by moving(non-constrained) vertices.\n Angle-based smoothing does not change the combinatorial information of the mesh.\n Area-based smoothing might change the combinatorial information, unless specified otherwise.\n It is also possible to make the smoothing algorithm \"safer\" by rejecting moves that, \n when applied, would worsen the quality of the mesh, e.g.that would decrease the value\n of the smallest angle around a vertex or create self-intersections.\n Optionally, the points are reprojected after each iteration.\n \n A valid triangle mesh.\n The edge angle that counts a feature and wont be smoothed.\n The number of iterations for the sequence of the smoothing iterations performed\n \n \n \n splits the edges listed in edges into sub-edges that are not longer than the given threshold max_length.\n Note this function is useful to split constrained edges before calling isotropic_remeshing() with protection\n of constraints activated (to match the constrained edge length required by the remeshing algorithm to be guaranteed to terminate)\n \n A valid mesh.\n The edge length above which an edge from edges is split into to sub-edges\n The number of new edges added to the mesh.\n \n \n \n splits the edges listed in edges into sub-edges that are not longer than the given threshold max_length.\n Note this function is useful to split constrained edges before calling isotropic_remeshing() with protection\n of constraints activated (to match the constrained edge length required by the remeshing algorithm to be guaranteed to terminate)\n \n A valid mesh.\n The edge length above which an edge from edges is split into to sub-edges\n The number of new edges added to the mesh.\n \n \n \n Triangulate a single face in the mesh.\n \n A valid mesh.\n The faces index in the mesh.\n True if successful.\n \n \n \n Triangulate a single face in the mesh.\n \n A valid mesh.\n The faces index in the mesh.\n True if successful.\n \n \n \n Triangulate a range of faces in the mesh.\n \n A valid mesh.\n The faces to triangulate.\n The length of the face array.\n True if successful.\n \n \n \n Triangulate a range of faces in the mesh.\n \n A valid mesh.\n The faces to triangulate.\n The length of the face array.\n True if successful.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Indicates if mesh bounds a volume.\n \n A closed triangle mesh.\n \n \n \n Indicates if mesh bounds a volume.\n \n A closed triangle mesh.\n \n \n \n Tests whether a closed triangle mesh has a positive orientation.\n A closed triangle mesh is considered to have a positive orientation\n if the normal vectors to all its faces point outside the domain bounded \n by the triangle mesh.The normal vector to each face is chosen pointing\n on the side of the face where its sequence of vertices is seen counterclockwise.\n \n A closed triangle mesh.\n \n \n \n Tests whether a closed triangle mesh has a positive orientation.\n A closed triangle mesh is considered to have a positive orientation\n if the normal vectors to all its faces point outside the domain bounded \n by the triangle mesh.The normal vector to each face is chosen pointing\n on the side of the face where its sequence of vertices is seen counterclockwise.\n \n A closed triangle mesh.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n A valid closed triangle mesh.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n A valid closed triangle mesh.\n \n \n \n Makes each connected component of a closed triangulated surface mesh inward or outward oriented.\n \n A closed triangle mesh.\n \n \n \n Makes each connected component of a closed triangulated surface mesh inward or outward oriented.\n \n A closed triangle mesh.\n \n \n \n Orients the connected components of tm to make it bound a volume.\n \n A closed triangle mesh.\n \n \n \n Orients the connected components of tm to make it bound a volume.\n \n A closed triangle mesh.\n \n \n \n Reverses for each face the order of the vertices along the face boundary.\n \n A valid mesh.\n \n \n \n Reverses for each face the order of the vertices along the face boundary.\n \n A valid mesh.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Find the number of degenerate edges in the mesh.\n \n The polygon mesh.\n The number of degenerate edges in the mesh.\n \n \n \n Find the number of degenerate faces in the mesh.\n \n A triangle polygon mesh.\n The number of degenerate faces in the mesh.\n \n \n \n Find the number of degenerate faces in the mesh.\n \n A triangle polygon mesh.\n The number of degenerate faces in the mesh.\n \n \n \n Checks whether a triangle face is needle.\n A triangle is said to be a needle if its longest edge is much longer than its shortest edge.\n \n A triangle polygon mesh.\n A bound on the ratio of the longest edge length and the shortest edge length.\n The number of needle triangles.\n \n \n \n Checks whether a triangle face is needle.\n A triangle is said to be a needle if its longest edge is much longer than its shortest edge.\n \n A triangle polygon mesh.\n A bound on the ratio of the longest edge length and the shortest edge length.\n The number of needle triangles.\n \n \n \n Collects the non-manifold vertices (if any) present in the mesh.\n A non-manifold vertex v is returned via one incident halfedge h such that target(h, pm) = v \n for all the umbrellas that v appears in (an umbrella being the set of faces incident to all \n the halfedges reachable by walking around v using hnext = prev(opposite(h, pm), pm), starting from h).\n \n A triangle polygon mesh.\n The non manifold vertex count.\n \n \n \n Collects the non-manifold vertices (if any) present in the mesh.\n A non-manifold vertex v is returned via one incident halfedge h such that target(h, pm) = v \n for all the umbrellas that v appears in (an umbrella being the set of faces incident to all \n the halfedges reachable by walking around v using hnext = prev(opposite(h, pm), pm), starting from h).\n \n A triangle polygon mesh.\n The non manifold vertex count.\n \n \n \n Cleans a given polygon soup through various repairing operations.\n \n More precisely, this function carries out the following tasks, in the same order as they are listed:\n \n merging of duplicate points.\n simplification of polygons to remove geometrically identical consecutive vertices;\n splitting of \"pinched\" polygons, that is polygons in which a geometric position appears more than once.\n The splitting process results in multiple non-pinched polygons;\n removal of invalid polygons, that is polygons with fewer than 2 vertices;\n removal of duplicate polygons.\n removal of isolated points.\n \n The polygon mesh.\n \n \n \n Cleans a given polygon soup through various repairing operations.\n \n More precisely, this function carries out the following tasks, in the same order as they are listed:\n \n merging of duplicate points.\n simplification of polygons to remove geometrically identical consecutive vertices;\n splitting of \"pinched\" polygons, that is polygons in which a geometric position appears more than once.\n The splitting process results in multiple non-pinched polygons;\n removal of invalid polygons, that is polygons with fewer than 2 vertices;\n removal of duplicate polygons.\n removal of isolated points.\n \n The polygon mesh.\n \n \n \n stitches together, whenever possible, two halfedges belonging to the same boundary cycle.\n Two border halfedges h1 and h2 can be stitched if the points associated to the source and\n target vertices of h1 are the same as those of the target and source vertices of h2, respectively.\n \n The polygon mesh.\n The number of stiched boundaries.\n \n \n \n stitches together, whenever possible, two halfedges belonging to the same boundary cycle.\n Two border halfedges h1 and h2 can be stitched if the points associated to the source and\n target vertices of h1 are the same as those of the target and source vertices of h2, respectively.\n \n The polygon mesh.\n The number of stiched boundaries.\n \n \n \n Stitches together border halfedges in a polygon mesh.\n \n The polygon mesh.\n The number of stiched borders.\n \n \n \n Stitches together border halfedges in a polygon mesh.\n \n The polygon mesh.\n The number of stiched borders.\n \n \n \n Removes the isolated vertices from any polygon mesh.\n A vertex is considered isolated if it is not incident to any simplex of higher dimension.\n \n The polygon mesh.\n The number of vertices that were removed.\n \n \n \n Removes the isolated vertices from any polygon mesh.\n A vertex is considered isolated if it is not incident to any simplex of higher dimension.\n \n The polygon mesh.\n The number of vertices that were removed.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Find the line formed from the intersection of the plane and the mesh.\n \n The mesh. Is not modified.\n The plane.\n The polylines from the intersection.\n \n \n \n Find the line formed from the intersection of the plane and the mesh.\n \n The mesh. Is not modified.\n The plane.\n The polylines from the intersection.\n \n \n \n Find the lines formed by slicing the mesh from the start\n point to the end point creating a plane at each increment.\n \n The mesh. Is not modified.\n The point to start from.\n The point to end at.\n Amount to increment each plane.\n he polylines from the intersection.\n \n \n \n Find the lines formed by slicing the mesh from the start\n point to the end point creating a plane at each increment.\n \n The mesh. Is not modified.\n The point to start from.\n The point to end at.\n Amount to increment each plane.\n he polylines from the intersection.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Simplify the mesh.\n \n A valid triangle mesh.\n A percentage 0-1 of edges to remove.\n \n \n \n Simplify the mesh.\n \n A valid triangle mesh.\n A percentage 0-1 of edges to remove.\n \n \n \n Release the unmanaged resourses.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Subdive each face in the mesh.\n \n \n A valid mesh. Must be a triangle mesh for loop or sqrt3.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n \n A valid mesh. Must be a triangle mesh for loop or sqrt3.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release the unmanaged resourses.\n \n \n \n \n Base triangulation class for Triangulation, DelaunayTriangulation,\n ConstrainedTriangulation and ConstrainedDelaunayTriangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulations kernel.\n \n \n \n \n The number of verices in the triangulation.\n \n \n \n \n The number of triangles in the triangulation.\n \n \n \n \n The number of indices need to represent the\n triangulation (number of triangles * 3).\n \n \n \n \n A number that will change if the unmanaged \n triangulation model changes.\n \n \n \n \n Clear the triangulation.\n \n \n \n \n Is this a valid triangulation.\n \n \n True if valid.\n \n \n \n Force the face and vertex indices to be set.\n \n \n \n \n Inserts point p in the triangulation.\n If point coincides with an already existing vertex the triangulation remains unchanged.\n If point is on an edge, the two incident faces are split in two.\n If point is strictly inside a face of the triangulation, the face is split in three.\n If point is strictly outside the convex hull, p is linked to all visible points on the \n convex hull to form the new triangulation.\n \n The point to insert.\n \n \n \n Inserts points into the triangulation.\n If point coincides with an already existing vertex the triangulation remains unchanged.\n If point is on an edge, the two incident faces are split in two.\n If point is strictly inside a face of the triangulation, the face is split in three.\n If point is strictly outside the convex hull, p is linked to all visible points on the \n convex hull to form the new triangulation.\n \n The points to insert.\n The ararys length.\n \n \n \n Get a array of all the points in the triangulation.\n \n The point array.\n The ararys length.\n \n \n \n Get a array of the triangle indices.\n \n \n The ararys length.\n \n \n \n Get the vertices point.\n \n The vertex index.\n The vertices point.\n True if the vertex was found.\n \n \n \n Get the point.\n \n The points index.\n The point\n If point with the index not found.\n \n \n \n Get a vertex.\n \n The vertex index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the vertex.\n \n The vertexs index.\n The vertexs\n If vertex with the index not found.\n \n \n \n Get a array of all the vertices.\n \n The vertex array.\n The ararys length.\n \n \n \n Get a triangule face.\n \n The faces index\n The face\n True if the face was found.\n \n \n \n Get the face.\n \n The faces index.\n The Faces\n If face with the index not found.\n \n \n \n Get a array of all the triangle faces.\n \n A array of faces.\n The ararys length.\n \n \n \n Get the segment between the face and a neighbour.\n \n The faces index\n The neighbour (0-2) index in the face.\n The segment.\n True if the face was found.\n \n \n \n Get the segment between the face and a neighbour.\n \n The faces index\n The neighbour (0-2) index in the face.\n The segment\n If segment with the index not found.\n \n \n \n Get a faces triangle.\n \n The faces index\n The triangle\n True if the face was found\n \n \n \n Get the triangle.\n \n The triangles index.\n The triangle\n If triangle with the index not found.\n \n \n \n Get a array of all the triangles.\n \n A array of triangules.\n The ararys length.\n \n \n \n Get a faces circumcenter.\n \n The faces index\n The circumcenter. A circle\n that passes through all three of the triangules vertices.\n True if the face was found.\n \n \n \n Get the circumcenter.\n \n The circumcenters index.\n The circumcenter\n If circumcenter with the index not found.\n \n \n \n Get a array of all the circumcenters.\n \n A array of circumcenters.\n The ararys length.\n \n \n \n Get the index of the faces neighbour.\n \n The faces index.\n The neighbour (0-2) index in the face.\n The index of the neighbour face in the triangulation. \n -1 if there is no neighbour face at this index.\n \n \n \n Locate the face the point hits.\n \n The point.\n The face the point has hit.\n True if the point hit a face.\n \n \n \n Locate the closest vertex to point.\n \n The point\n The distance the point must be within to count as hitting the vertex.\n The closest vertex.\n True if point hit a face and found a vertex.\n \n \n \n Locate the closest edge and segment to point.\n \n The point\n The distance the point must be within to count as hitting the edge.\n The closest edge.\n True if the point hit a face and found a edge.\n \n \n \n Remove the vertex.\n \n The vertices index.\n True if removed.\n \n \n \n Flip a edge between the face and a neighbour.\n \n The faces index\n The neighbour (0-2) index in the face.\n True if the edge was flipped.\n \n \n \n Translate the triangulation.\n \n The amount to translate.\n \n \n \n Rotate the triangulation.\n \n The amount to rotate in radians.\n \n \n \n Scale the triangulation.\n \n The amount to scale.\n \n \n \n Transform the triangulation with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Base triangulation class for Triangulation, DelaunayTriangulation \n and ConstrainedTriangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulations kernel.\n \n \n \n \n Returns the buildStamp.\n The build stamp will change if \n the triangulation model has changed\n \n \n \n \n Returns the dimension of the affine hull.\n \n \n \n \n Returns the number of vertices.\n \n \n \n \n Returns the number of finite vertices.\n \n \n \n \n Returns the number of cells or 0 if Dimension less than 3.\n \n \n \n \n The number of finite cells.\n Returns 0 if Dimension less than 3.\n \n \n \n \n The number of edges.\n Returns 0 if Dimension less than 1.\n \n \n \n \n The number of finite edges.\n Returns 0 if Dimension less than 1.\n \n \n \n \n The number of facets.\n Returns 0 if Dimension less than 2.\n \n \n \n \n The number of facets.\n Returns 0 if Dimension less than 2.\n \n \n \n \n The number of indices needed for the finite tetrahedrons.\n \n \n \n \n Clear the triangulation.\n \n \n \n \n \n \n \n \n \n \n Inserts the point p in the triangulation.\n If point p coincides with an already existing vertex the triangulation remains unchanged.\n If point p lies in the convex hull of the points, it is added naturally: \n if it lies inside a cell, the cell is split into four cells, if it lies \n on a facet, the two incident cells are split into three cells, if it lies\n on an edge, all the cells incident to this edge are split into two cells.\n If point p is strictly outside the convex hull but in the affine hull, p \n is linked to all visible points on the convex hull to form the new triangulation.\n If point p is outside the affine hull of the points, p is linked to all the points,\n and the dimension of the triangulation is incremented. All the points now belong to \n the boundary of the convex hull, so, the infinite vertex is linked to all the points \n to triangulate the new infinite face.\n \n The point to insert\n \n \n \n Insert all the points in the array.\n \n The points to insert.\n The arrays length\n \n \n \n Insert a vertex into a cell.\n \n The cells index.\n The point to insert.\n \n \n \n If the point query lies inside the convex hull of the points, the cell that contains the query in its interior is returned.\n If query lies on a facet, an edge or on a vertex, one of the cells having query on its boundary is returned.\n If the point query lies outside the convex hull of the points, an infinite cell with vertices { p,q,r,∞} is\n returned such that the tetrahedron(p, q, r, query) is positively oriented(the rest of the triangulation lies\n on the other side of facet (p, q, r)).\n Note that locate works even in degenerate dimensions: in dimension 2 (resp. 1, 0) the Cell_handle returned\n is the one that represents the facet(resp.edge, vertex) containing the query point.\n The optional argument start is used as a starting place for the search.\n The optional argument could_lock_zone is used by the concurrency-safe version of the triangulation.When the\n pointer is not null, the locate will try to lock all the cells along the walk. If it succeeds,\n could_lock_zone is true, otherwise it is false. In any case, the locked cells are not unlocked by locate,\n leaving this choice to the user. \n \n The point to query\n The cell thats closest to point.\n The closest cell to point.\n \n \n \n Get the centroids of each cell.\n \n The array of points\n The array of points length\n \n \n \n Get all the points in the triangulation.\n \n The array to copy into.\n The arrays length.\n \n \n \n Get all the points in the triangulation.\n \n The array to copy into.\n \n \n \n Get the triangulation vertices.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get a triangulation vertex.\n \n The vertices index\n The vertex.\n \n \n \n \n Get the triangulation vertices.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get a triangulation vertex.\n \n The vertices index\n The vertex.\n \n \n \n \n Get the indices of the cells edges in the triangulation.\n \n The indices array.\n The indices array length.\n \n \n \n Get the indices of the cells triangles in the triangulation.\n \n The indices array.\n The indices array length.\n \n \n \n Get the indices of the tetrahedron cells in the triangulation.\n \n The indices array.\n The indices array length.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n The generic constrained triangulation class.\n \n The kernel\n \n \n \n A static instance of the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as a string.\n \n \n \n \n \n A deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n The abstract triangulation class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the constrained triangulation.\n \n \n \n \n The number of constrainted edges in the triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n The moved vertex\n True if the vertex was found.\n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Get the number of constrainted edges incident to this vertex.\n \n The vertex index in the triagulation.\n The number of constrainted edges to the vertex.\n \n \n \n Does this vertex have a constrainted edge.\n \n The vertex index in the triagulation.\n Does this vertex have a constrainted edge.\n \n \n \n Add a segment as a constraint.\n \n The segment to add.\n \n \n \n Add the two points as a segment constraint.\n \n The segments point a.\n The segments point b.\n \n \n \n Add a list of segments as constraint to the triangulation.\n \n The segment array.\n The length of the segment array.\n \n \n \n Get a array of all the constraint edges in the triangulation.\n \n The edge array.\n The ararys length.\n \n \n \n Get a array of all the constraint segments in the triangulation.\n \n The segment array.\n The ararys length.\n \n \n \n Get the constraints incident to the vertex.\n \n The vertex index in the triangulation.\n The array of edges.\n The ararys length.\n \n \n \n Remove a constraint between a face and its neighbour.\n \n The faces index in the triangultion.\n The neighbours index in the faces neighbour array between 0-2.\n \n \n \n Remove all constraints incident to a vertex.\n \n The vertex index in the triangulation.\n \n \n \n Get the triangle indices for domain in the triangultion.\n Used to triangulate polygons.\n \n The indices.\n \n \n \n \n \n \n \n \n \n The generic constrained triangulation class.\n \n The kernel\n \n \n \n A static instance of the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as a string.\n \n \n \n \n \n A deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n The abstract triangulation class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the constrained triangulation.\n \n \n \n \n The number of constrainted edges in the triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n The moved vertex\n True if the vertex was found.\n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Get the number of constrainted edges incident to this vertex.\n \n The vertex index in the triagulation.\n The number of constrainted edges to the vertex.\n \n \n \n Does this vertex have a constrainted edge.\n \n The vertex index in the triagulation.\n Does this vertex have a constrainted edge.\n \n \n \n Add a segment as a constraint.\n \n The segment to add.\n \n \n \n Add the two points as a segment constraint.\n \n The segments point a.\n The segments point b.\n \n \n \n Add a list of segments as constraint to the triangulation.\n \n The segment array.\n The length of the segment array.\n \n \n \n Get a array of all the constraint edges in the triangulation.\n \n The edge array.\n The ararys length.\n \n \n \n Get a array of all the constraint segments in the triangulation.\n \n The segment array.\n The ararys length.\n \n \n \n Get the constraints incident to the vertex.\n \n The vertex index in the triangulation.\n The array of edges.\n The ararys length.\n \n \n \n Remove a constraint between a face and its neighbour.\n \n The faces index in the triangultion.\n The neighbours index in the faces neighbour array between 0-2.\n \n \n \n Remove all constraints incident to a vertex.\n \n The vertex index in the triangulation.\n \n \n \n Get the triangle indices for domain in the triangultion.\n Used to triangulate polygons.\n \n The indices.\n \n \n \n \n \n \n \n \n \n The generic delaunay triangulation class.\n \n The kerne\n \n \n \n A static instance of the delaunay triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as string.\n \n \n \n \n \n A deep copy of the triangulation.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points into the triangulation.\n May not retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n The anstract base class for the delaunay triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the delaunay triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n If there is not already another vertex placed on the point, \n the triangulation is modified such that the new position of vertex same as point.\n The moved vertex\n True if the vertex was found.\n \n \n \n If the dual voronoi diagram of the triangulation is taken\n How many segments and rays would be produced.\n \n The number of segments.\n The number of rays.\n \n \n \n Get a array of the voronoi's segments.\n \n A array of the voronoi's segments.\n \n \n \n Get a array of the voronois rays.\n These are the segment at edge of triangulation that \n a end point can not be determined.\n \n A array of the voronoi's rays.\n \n \n \n \n \n \n \n \n \n Generic triangulation class.\n \n The kerel.\n \n \n \n Static instance of a triangulation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct a triangulation from the points.\n \n The triangulation points.\n \n \n \n Construct from a existing triangulation.\n \n A pointer to the unmanaged object.\n \n \n \n The triangulation as a string.\n \n \n \n \n \n Create a deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Refine the triangulation.\n \n The target edge lengths.\n The number of iterations.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n Abstract base class for the triagulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the triangulation.\n \n \n \n \n Move a vertex.\n \n The vertices index.\n The point to move to.\n Should the vertex only be moved if there is no coliision.\n If the vertex was moved.\n \n \n \n Find the index of the nearest vertex to the point.\n \n The point.\n The index of the nearest vertex to the point.\n \n \n \n Find the index of the nearest vertex to the point.\n Presumes poimt is in a cell.\n \n The cells index.\n The point.\n The index of the nearest vertex to the point.\n \n \n \n Remobe a vertex.\n \n The vertex index.\n True if vertex was removed.\n \n \n \n \n \n \n \n \n \n Generic triangulation class.\n \n The kerel.\n \n \n \n Static instance of a triangulation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct a triangulation from the points.\n \n The triangulation points.\n \n \n \n Construct from a existing triangulation.\n \n A pointer to the unmanaged object.\n \n \n \n The triangulation as a string.\n \n \n \n \n \n Create a deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Insert the points of the polygon into the triagulation.\n May no have the same edges as polygon.\n \n The polygon to insert/\n \n \n \n Insert the points of the polygon into the triagulation.\n May no have the same edges as polygon.\n \n The polygon to insert/\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n Abstract base class for the triagulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n If there is not already another vertex placed on the point, \n the triangulation is modified such that the new position of vertex same as point.\n The moved vertex\n True if the vertex was found.\n \n \n \n \n \n \n \n \n \n Generic triangulation class.\n \n The kerel.\n \n \n \n Static instance of a triangulation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct a triangulation from the points.\n \n The triangulation points.\n \n \n \n Construct from a existing triangulation.\n \n A pointer to the unmanaged object.\n \n \n \n The triangulation as a string.\n \n \n \n \n \n Create a deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Refine the triangulation.\n \n The target edge lengths.\n The number of iterations.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n Abstract base class for the triagulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the triangulation.\n \n \n \n \n \n \n \n \n \n \n From Index to HalfEdgeIndex must match layout\n of the unmanaged TriFace2 in the TriFace2 header file.\n \n \n \n \n Is this the infinite cell.\n \n \n \n \n The cells index in the triangulation.\n \n \n \n \n The cells 4 vertices.\n \n \n \n \n The cells 4 neighbor cells.\n \n \n \n \n \n \n \n \n \n \n Are the two cells equal.\n \n The first cell.\n The second cell.\n True if the cells are equal.\n \n \n \n Are the two cells not equal.\n \n The first cell.\n The second cell.\n True if the cells are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these cells equal.\n \n The other cell.\n True if the cells are equal.\n \n \n \n The cells hash code.\n \n The cells hash code.\n \n \n \n Get a vertex index.\n \n The vertices index 0-3.\n The vertices index in the triangulation.\n \n \n \n Get a neighbor cell index.\n \n The neighbor cell index 0-3.\n A neighbor cell index in the triangulation.\n \n \n \n Enumerate the vertices of the cell.\n \n The triangle the vertices below too.\n The cell vertices.\n \n \n \n Enumerate the vertices of the cell.\n \n The vertices array.\n The cell vertices.\n \n \n \n Enumerate the vertices of the cell.\n \n The triangle the vertices below too.\n The cell vertices.\n \n \n \n Enumerate the neighbors of the cell.\n \n The cell array.\n The cell neighbors.\n \n \n \n Are the two vertex arrays equal.\n \n \n \n \n \n \n \n Are the two neighbor arrays equal.\n \n \n \n \n \n \n \n From Index to TwinIndex must match layout\n of the unmanaged TriEdge2 in the TriEdge2 header file.\n \n \n \n \n The edges face index in the triangulation.\n \n \n \n \n The neighbours index in the face array betwen 0 and 2.\n \n \n \n \n The edges segment.\n \n \n \n \n \n \n The face index in the triangulation\n The neighbours index in the face array betwen 0 and 2.\n \n \n \n Are the two edges equal.\n \n The first edge.\n The second edge.\n True if the edges are equal.\n \n \n \n Are the two edges not equal.\n \n The first edge.\n The second edge.\n True if the edges are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these edges equal.\n \n The other edge.\n True if the edges are equal.\n \n \n \n The edges hash code.\n \n The edges hash code.\n \n \n \n From Index to HalfEdgeIndex must match layout\n of the unmanaged TriFace2 in the TriFace2 header file.\n \n \n \n \n Is this the infinite face.\n \n \n \n \n The faces index in the triangulation.\n \n \n \n \n The faces 3 vertices.\n \n \n \n \n \n \n \n \n \n \n Are the two faces equal.\n \n The first face.\n The second face.\n True if the faces are equal.\n \n \n \n Are the two faces not equal.\n \n The first face.\n The second face.\n True if the faces are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these faces equal.\n \n The other face.\n True if the faces are equal.\n \n \n \n The faces hash code.\n \n The faces hash code.\n \n \n \n Get a vertex index and wrap around array.\n \n The vertices index wrapped to 0-2.\n The vertices index in the triangulation.\n \n \n \n Enumerate the vertices of the face.\n \n The triangle the vertices below too.\n The face vertices.\n \n \n \n Enumerate the vertices of the face.\n \n The vertices array.\n The face vertices.\n \n \n \n From Point to HalfEdgeIndex must match layout\n of the unmanaged TriVertex2 in the TriVertex2 header file.\n \n \n \n \n The vertices point.\n \n \n \n \n Is this a infinite vertex.\n \n \n \n \n The number of egdes connected to the vertex.\n \n \n \n \n The vertices index in the triangulation.\n \n \n \n \n The one of the vertexs the vertex is connected to.\n \n \n \n \n Are the two vertexs equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are equal.\n \n \n \n Are the two vertexs not equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these vertexs equal.\n \n The other vertex.\n True if the vertexs are equal.\n \n \n \n The vertexs hash code.\n \n The vertexs hash code.\n \n \n \n \n \n \n \n \n The vertices point.\n \n \n \n \n Is this a infinte vertex.\n \n \n \n \n The vertices degree is the \n number of edges connecting to it.\n \n \n \n \n The vertices index in the triangulation.\n \n \n \n \n The one of the cells the vertex is connected to.\n \n \n \n \n Are the two vertices equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are equal.\n \n \n \n Are the two vertices not equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these vertexs equal.\n \n The other vertex.\n True if the vertexs are equal.\n \n \n \n The vertexs hash code.\n \n The vertexs hash code.\n \n \n \n Enumerate around all the other vertices in this vertexs cell.\n \n The triangulation the vertex belongs to.\n All the other vertices in this vertexs cell\n \n \n \n Enumerate around all the other vertices in this vertexs cell.\n \n A array of the other vertices in the triangulation.\n A array of the other cells in the triangulation.\n All the other vertices in this vertexs cell\n \n \n \n Cache to reuse arrays.\n Thread safe?\n \n \n \n \n Returns a array of Point2d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of Point2d objects that is at least the size of count.\n \n \n \n Returns a array of Segment2d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of Segment2d objects that is at least the size of count.\n \n \n \n Returns a array of Point3d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of Point3d objects that is at least the size of count.\n \n \n \n Returns a array of HPoint3d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of HPoint3d objects that is at least the size of count.\n \n \n \n Returns a array of ints that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of ints that is at least the size of count.\n \n \n \n Returns a array of ints that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of ints that is at least the size of count.\n \n \n \n Should a new array be created.\n \n The current array.\n The required new array size.\n Creates a new array if disabled, the current one is null or to small.\n \n \n \n Check a array that is passed to the c++ dll.\n If the array is invalid it will cause a hard crash.\n Array can be null if count is 0;\n \n \n \n \n \n\n"
},
{
"path": "Binaries/CGALDotNetGeometry.xml",
"content": "\n\n \n CGALDotNetGeometry\n \n \n \n \n Add two colors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Subtract two colors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two colors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two colors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Are these colors equal.\n \n \n \n \n Are these colors not equal.\n \n \n \n \n Are these colors equal.\n \n \n \n \n Are these colors equal given the error.\n \n \n \n \n Are these colors equal.\n \n \n \n \n colors hash code. \n \n \n \n \n color as a string.\n \n \n \n \n color as a string.\n \n \n \n \n color from bytes.\n \n \n \n \n The distance between two colors.\n \n \n \n \n The square distance between two colors.\n \n \n \n \n Convert to RGB color space.\n \n \n \n \n Generates a list of colors with hues ranging from 0 360\n and a saturation and value of 1. \n \n \n \n \n Add two colors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Subtract two colors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two colors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two colors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Are these colors equal.\n \n \n \n \n Are these colors not equal.\n \n \n \n \n Are these colors equal.\n \n \n \n \n Are these colors equal given the error.\n \n \n \n \n Are these colors equal.\n \n \n \n \n colors hash code. \n \n \n \n \n color as a string.\n \n \n \n \n color as a string.\n \n \n \n \n color from bytes.\n \n \n \n \n The distance between two colors.\n \n \n \n \n The square distance between two colors.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n Clamp the each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Convert to HSV color space.\n \n \n \n \n Create a palette of 6 colors from the rainbow.\n \n \n \n \n \n Create a palette of colors.\n \n \n \n \n \n Create a custom palette of hues with the same saturation and value.\n \n The number of hues in the palette.\n The saturation of the colors.\n The values of the colors.\n \n \n \n \n Add two colors.\n \n \n \n \n Add color and scalar.\n \n \n \n \n Add color and scalar.\n \n \n \n \n Subtract two colors.\n \n \n \n \n Subtract color and scalar.\n \n \n \n \n Subtract color and scalar.\n \n \n \n \n Multiply two colors.\n \n \n \n \n Multiply a color and a scalar.\n \n \n \n \n Multiply a color and a scalar.\n \n \n \n \n Divide two colors.\n \n \n \n \n Divide a color and a scalar.\n \n \n \n \n Are these colors equal.\n \n \n \n \n Are these colors not equal.\n \n \n \n \n Are these colors equal.\n \n \n \n \n Are these colors equal given the error.\n \n \n \n \n Are these colors equal.\n \n \n \n \n colors hash code. \n \n \n \n \n color as a string.\n \n \n \n \n color as a string.\n \n \n \n \n color from bytes.\n \n \n \n \n The distance between two colors.\n \n \n \n \n The square distance between two colors.\n \n \n \n \n color from ints.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n Clamp the each component to specified min and max.\n \n \n \n \n Lerp between two colors.\n \n \n \n \n Convert to HSV color space.\n \n \n \n \n Represents a angle in degrees.\n \n \n \n \n The angle in degrees.\n \n \n \n \n The degrees angle in radians.\n \n \n \n \n 0 degrees.\n \n \n \n \n 90 degrees.\n \n \n \n \n 180 degrees.\n \n \n \n \n 270 degrees.\n \n \n \n \n 360 degrees.\n \n \n \n \n Create a new degree from a value.\n \n The angle in degrees.\n \n \n \n Add two angles.\n \n \n \n \n Add angle and scalar.\n \n \n \n \n Negate the angle.\n \n \n \n \n Add angle and scalar.\n \n \n \n \n Subtract two angles.\n \n \n \n \n Subtract angle and scalar.\n \n \n \n \n Subtract angle and scalar.\n \n \n \n \n Multiply two angles.\n \n \n \n \n Multiply a angle and a scalar.\n \n \n \n \n Multiply a angle and a scalar.\n \n \n \n \n Divide two angles.\n \n \n \n \n Divide a angle and a scalar.\n \n \n \n \n Is the degree less than the scalar.\n \n \n \n \n Is the degree less than or equal to the scalar.\n \n \n \n \n Is the degree greater than the scalar.\n \n \n \n \n Is the degree greater than or equal to the scalar.\n \n \n \n \n Is the degree less than the other degree.\n \n \n \n \n Is the degree less than or equal to the other degree.\n \n \n \n \n Is the degree greater than the other degree.\n \n \n \n \n Is the degree greater than or equal to the other degree.\n \n \n \n \n Cast from a radian to degrees.\n \n The angle in radians.\n \n \n \n Are these angles equal.\n \n \n \n \n Are these angles not equal.\n \n \n \n \n Are these angles equal.\n \n \n \n \n Are these angles equal.\n \n \n \n \n Angles hash code. \n \n \n \n \n Angles as a string.\n \n \n \n \n Angles as a string.\n \n \n \n \n A rounded angle.\n \n The number of digits to round to.\n The rounded angle\n \n \n \n A Homogenous 2D point struct.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Convert from homogenous to cartesian space.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The number of points weight.\n The range of the points.\n The point array.\n \n \n \n A Homogenous 2D point struct.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Convert from homogenous to cartesian space.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The number of points weight.\n The range of the points.\n The point array.\n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Convert from homogenous to cartesian space.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as vector.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The number of points weight.\n The range of the points.\n The point array.\n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Convert from homogenous to cartesian space.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as vector.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The number of points weight.\n The range of the points.\n The point array.\n \n \n \n WARNING - Must match layout of unmanaged c++ CGAL struct in Index.h file.\n \n \n \n \n Wrap a value between 0 and count-1 (inclusive).\n \n \n \n \n Mirror a value between 0 and count-1 (inclusive).\n \n \n \n \n Is number a power of 2.\n \n \n \n \n Return the closest pow2 number to num.\n \n \n \n \n Return the closest pow2 number thats less than num.\n \n \n \n \n Simple int pow function.\n System Math.Pow may produce precision errors.\n \n \n \n \n Return the Binomial coefficients.\n \n N\n n\n \n \n \n \n Returns the factorial of number.\n Must be less than or equal MAX_FACTORIAL or overflow will occur.\n \n \n \n \n Returns the factorial of number using a BigInteger.\n \n \n \n \n Given N objects, how many unique sets exist.\n \n \n \n \n Given N objects, how many unique sets exist of size n \n where the order matters and objects may repeat.\n \n The size of the sets\n The total number of objects\n The number of sets possible\n \n \n \n Given N objects, how many unique sets exist of size n \n where the order does not matters and objects may repeat.\n \n The size of the sets\n The total number of objects\n The number of sets possible\n \n \n \n Given N objects, how many unique sets exist of size n \n where the order matters and objects may not repeat.\n \n The size of the sets\n The total number of objects\n The number of sets possible\n \n \n \n Given N objects, how many unique sets exist of size n \n where the order does not matters and objects may not repeat.\n \n The size of the sets\n The total number of objects\n The number of sets possible\n \n \n \n Creates a look up table for factorials.\n \n \n \n \n Matrix is column major. Data is accessed as: row + (column*2). \n Matrices can be indexed like 2D arrays but in an expression like mat[a, b], \n a refers to the row index, while b refers to the column index \n (note that this is the opposite way round to Cartesian coordinates).\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The Matrix Idenity.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix from the following column vectors.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix copied from a array of varibles.\n \n \n \n \n Access the varible at index i\n \n \n \n \n Is this the identity matrix.\n \n \n \n \n Access the varible at index ij\n \n \n \n \n The transpose of the matrix. The rows and columns are flipped.\n \n \n \n \n The determinate of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Add two matrices.\n \n \n \n \n Subtract two matrices.\n \n \n \n \n Multiply two matrices.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Cast to double matrix from a float matrix.\n \n The other matrix\n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices not equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Matrices hash code. \n \n \n \n \n A matrix as a string.\n \n \n \n \n The Inverse of the matrix copied into mInv.\n Returns false if the matrix has no inverse.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Get the ith column as a vector.\n \n \n \n \n Set the ith column from avector.\n \n \n \n \n Get the ith row as a vector.\n \n \n \n \n Set the ith row from avector.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Convert to a float precision 3 dimension matrix.\n \n \n \n \n Matrix is column major. Data is accessed as: row + (column*2). \n Matrices can be indexed like 2D arrays but in an expression like mat[a, b], \n a refers to the row index, while b refers to the column index \n (note that this is the opposite way round to Cartesian coordinates).\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The Matrix Idenity.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix from the following column vectors.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix copied from a array of varibles.\n \n \n \n \n Access the varible at index i\n \n \n \n \n Access the varible at index ij\n \n \n \n \n Is this the identity matrix.\n \n \n \n \n The transpose of the matrix. The rows and columns are flipped.\n \n \n \n \n The determinate of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Add two matrices.\n \n \n \n \n Subtract two matrices.\n \n \n \n \n Multiply two matrices.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Cast to float matrix from a double matrix.\n \n The other matrix\n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices not equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Matrices hash code. \n \n \n \n \n A matrix as a string.\n \n \n \n \n The Inverse of the matrix copied into mInv.\n Returns false if the matrix has no inverse.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Get the ith column as a vector.\n \n \n \n \n Set the ith column from avector.\n \n \n \n \n Get the ith row as a vector.\n \n \n \n \n Set the ith row from avector.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Convert to a single precision 3 dimension matrix.\n \n \n \n \n Matrix is column major. Data is accessed as: row + (column*3). \n Matrices can be indexed like 2D arrays but in an expression like mat[a, b], \n a refers to the row index, while b refers to the column index \n (note that this is the opposite way round to Cartesian coordinates).\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The Matrix Idenity.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix from the following column vectors.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix copied from a array of varibles.\n \n \n \n \n Is this the identity matrix.\n \n \n \n \n Does the matric have scale.\n \n \n \n \n Access the varible at index i\n \n \n \n \n Access the varible at index ij\n \n \n \n \n The transpose of the matrix. The rows and columns are flipped.\n \n \n \n \n The determinate of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Add two matrices.\n \n \n \n \n Subtract two matrices.\n \n \n \n \n Multiply two matrices.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Cast to double matrix from a float matrix.\n \n The other matrix\n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices not equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Matrices hash code. \n \n \n \n \n A matrix as a string.\n \n \n \n \n The Inverse of the matrix copied into mInv.\n Returns false if the matrix has no inverse.\n A matrix multipled by its inverse is the idenity.\n Invert a 3x3 using cofactors. This is about 8 times faster than\n the Numerical Recipes code which uses Gaussian elimination.\n \n \n \n \n Get the ith column as a vector.\n \n \n \n \n Set the ith column from avector.\n \n \n \n \n Get the ith row as a vector.\n \n \n \n \n Set the ith row from avector.\n \n \n \n \n Convert to a REAL precision 4 dimension matrix.\n \n \n \n \n Create a translation out of a vector.\n \n \n \n \n Create a translation out of a point.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a scale out of a point.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Create a rotation out of a vector.\n \n \n \n \n Matrix is column major. Data is accessed as: row + (column*3). \n Matrices can be indexed like 2D arrays but in an expression like mat[a, b], \n a refers to the row index, while b refers to the column index \n (note that this is the opposite way round to Cartesian coordinates).\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The Matrix Idenity.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix from the following column vectors.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix copied from a array of varibles.\n \n \n \n \n Access the varible at index i\n \n \n \n \n Access the varible at index ij\n \n \n \n \n Is this the identity matrix.\n \n \n \n \n Does the matric have scale.\n \n \n \n \n The transpose of the matrix. The rows and columns are flipped.\n \n \n \n \n The determinate of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Add two matrices.\n \n \n \n \n Subtract two matrices.\n \n \n \n \n Multiply two matrices.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Cast to float matrix from a double matrix.\n \n The other matrix\n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices not equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Matrices hash code. \n \n \n \n \n A matrix as a string.\n \n \n \n \n The Inverse of the matrix copied into mInv.\n Returns false if the matrix has no inverse.\n A matrix multipled by its inverse is the idenity.\n Invert a 3x3 using cofactors. This is about 8 times faster than\n the Numerical Recipes code which uses Gaussian elimination.\n \n \n \n \n Get the ith column as a vector.\n \n \n \n \n Set the ith column from avector.\n \n \n \n \n Get the ith row as a vector.\n \n \n \n \n Set the ith row from avector.\n \n \n \n \n Convert to a single precision 4 dimension matrix.\n \n \n \n \n Create a translation out of a vector.\n \n \n \n \n Create a translation out of a point.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a scale out of a point.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Create a rotation out of a angle.\n \n \n \n \n Create a rotation out of a vector.\n \n \n \n \n Matrix is column major. Data is accessed as: row + (column*4). \n Matrices can be indexed like 2D arrays but in an expression like mat[a, b], \n a refers to the row index, while b refers to the column index \n (note that this is the opposite way round to Cartesian coordinates).\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The Matrix Idenity.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix from the following column vectors.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix copied from a array of varibles.\n \n \n \n \n Access the varible at index i\n \n \n \n \n Access the varible at index ij\n \n \n \n \n Is this the identity matrix.\n \n \n \n \n Does the matric have scale.\n \n \n \n \n The transpose of the matrix. The rows and columns are flipped.\n \n \n \n \n The determinate of a matrix. \n \n \n \n \n The adjoint of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Add two matrices.\n \n \n \n \n Subtract two matrices.\n \n \n \n \n Multiply two matrices.\n \n \n \n \n Multiply a vector by a matrix.\n Acts like z is 0, and w is 0.\n \n \n \n \n Multiply a vector by a matrix.\n Acts like w is 0.\n \n \n \n \n Multiply a point by a matrix.\n Acts like z is 0, and w is 1.\n \n \n \n \n Multiply a point by a matrix.\n Acts like w is 1.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Cast to double matrix from a float matrix.\n \n The other matrix\n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices not equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Matrices hash code. \n \n \n \n \n A matrix as a string.\n \n \n \n \n The minor of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Get the ith column as a vector.\n \n \n \n \n Set the ith column from a vector.\n \n \n \n \n Get the ith row as a vector.\n \n \n \n \n Set the ith row from a vector.\n \n \n \n \n Convert to a 3 dimension matrix.\n \n \n \n \n Create a translation, rotation and scale.\n \n \n \n \n Create a translation and rotation.\n \n \n \n \n Create a translation and scale.\n \n \n \n \n Create a rotation and scale.\n \n \n \n \n Create a translation out of a vector.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a rotation out of a angle in degrees.\n \n \n \n \n Create a rotation out of a angle in degrees.\n \n \n \n \n Create a rotation out of a angle in degrees.\n \n \n \n \n Create a rotation out of a vector.\n \n \n \n \n Create a perspective matrix.\n \n \n \n \n Create a ortho matrix.\n \n \n \n \n Creates the matrix need to look at target from position.\n \n \n \n \n Matrix is column major. Data is accessed as: row + (column*4). \n Matrices can be indexed like 2D arrays but in an expression like mat[a, b], \n a refers to the row index, while b refers to the column index \n (note that this is the opposite way round to Cartesian coordinates).\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The matrix\n \n \n \n \n The Matrix Idenity.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix from the following column vectors.\n \n \n \n \n A matrix from the following varibles.\n \n \n \n \n A matrix copied from a array of varibles.\n \n \n \n \n Access the varible at index i\n \n \n \n \n Access the varible at index ij\n \n \n \n \n Is this the identity matrix.\n \n \n \n \n Does the matric have scale.\n \n \n \n \n The transpose of the matrix. The rows and columns are flipped.\n \n \n \n \n The determinate of a matrix. \n \n \n \n \n The adjoint of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Add two matrices.\n \n \n \n \n Subtract two matrices.\n \n \n \n \n Multiply two matrices.\n \n \n \n \n Multiply a vector by a matrix.\n Acts like z is 0, and w is 0.\n \n \n \n \n Multiply a vector by a matrix.\n Acts like w is 0.\n \n \n \n \n Multiply a point by a matrix.\n Acts like z is 0, and w is 1.\n \n \n \n \n Multiply a point by a matrix.\n Acts like w is 1.\n \n \n \n \n Multiply a vector by a matrix.\n \n \n \n \n Multiply a point by a matrix.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Multiply a matrix by a scalar.\n \n \n \n \n Cast to float matrix from a double matrix.\n \n The other matrix\n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices not equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Are these matrices equal.\n \n \n \n \n Matrices hash code. \n \n \n \n \n A matrix as a string.\n \n \n \n \n The minor of a matrix. \n \n \n \n \n The inverse of the matrix.\n A matrix multipled by its inverse is the idenity.\n \n \n \n \n Get the ith column as a vector.\n \n \n \n \n Set the ith column from a vector.\n \n \n \n \n Get the ith row as a vector.\n \n \n \n \n Set the ith row from a vector.\n \n \n \n \n Convert to a 3 dimension matrix.\n \n \n \n \n Create a translation, rotation and scale.\n \n \n \n \n Create a translation and rotation.\n \n \n \n \n Create a translation and scale.\n \n \n \n \n Create a rotation and scale.\n \n \n \n \n Create a translation out of a vector.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a scale out of a vector.\n \n \n \n \n Create a rotation out of a angle in degrees.\n \n \n \n \n Create a rotation out of a angle in degrees.\n \n \n \n \n Create a rotation out of a angle in degrees.\n \n \n \n \n Create a rotation out of a vector.\n \n \n \n \n Create a perspective matrix.\n \n \n \n \n Create a ortho matrix.\n \n \n \n \n Creates the matrix need to look at target from position.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 2D point to 3D point with z as 0.\n \n \n \n \n 2D point to 3D point with y as z.\n \n \n \n \n 2D point to 3D point with z as 1.\n \n \n \n \n 2D point to 4D point with z as 0 and w as 0.\n \n \n \n \n 2D point to 4D point with z as 0 and w as 1.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components ofpoint finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Point as a vector.\n \n \n \n \n Point as a homogenous point.\n \n \n \n \n Point as a homogenous point.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two point and vector.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract a point and a vector.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point2f to Point2d.\n \n \n \n \n \n Cast from Point2i to Point2d.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Are these points equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n The first point.\n The second point.\n Should the vector be normalized.\n The vector from v0 to v1.\n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two points.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The range of the points.\n The point array.\n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 2D point to 3D point with z as 0.\n \n \n \n \n 2D point to 3D point with y as z.\n \n \n \n \n 2D point to 3D point with z as 1.\n \n \n \n \n 2D point to 4D point with z as 0 and w as 0.\n \n \n \n \n 2D point to 4D point with z as 0 and w as 1.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components of point finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Point as a vector.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the point.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two point and vector.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract a point and a vector.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point2d to Point2f.\n \n \n \n \n \n Cast from Point2i to Point2f.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Are these points equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n The first point.\n The second point.\n Should the vector be normalized.\n The vector from v0 to v1.\n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two points.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The range of the points.\n The point array.\n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 2D point to 3D point with z as 0.\n \n \n \n \n 2D point to 3D point with y as z.\n \n \n \n \n 2D point to 3D point with z as 1.\n \n \n \n \n 2D point to 4D point with z as 0 and w as 0.\n \n \n \n \n 2D point to 4D point with z as 0 and w as 1.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Convert to float vector.\n \n \n \n \n Convert to double vector.\n \n \n \n \n Convert to float point.\n \n \n \n \n Convert to double point.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the point squared.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point2f to Point2i.\n \n \n \n \n \n Cast from Point2d to Point2i.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 3D point to 3D swizzle point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 4D point with w as 0.\n \n \n \n \n 3D point to 4D point with w as 1.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components ofpoint finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as a homogenous point.\n \n \n \n \n Point as a homogenous point.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two point and vector.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract a point and a vector.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Cast from Point43f to Point3d.\n \n \n \n \n \n Cast from Point3i to Point3d.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n The first point.\n The second point.\n Should the vector be normalized.\n The vector from v0 to v1.\n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two points.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The range of the points.\n The point array.\n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 3D point to 3D swizzle point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 4D point with w as 0.\n \n \n \n \n 3D point to 4D point with w as 1.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components ofpoint finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as vector.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two point and vector.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract a point and a vector.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point3d to Point3f.\n \n \n \n \n \n Cast from Point3i to Point3f.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n The first point.\n The second point.\n Should the vector be normalized.\n The vector from v0 to v1.\n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two points.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n Create a array of random points.\n \n The seed\n The number of points to create.\n The range of the points.\n The point array.\n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 3D point to 3D swizzle point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 2D point.\n \n \n \n \n 3D point to 4D point with w as 0.\n \n \n \n \n 3D point to 4D point with w as 1.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Convert to float vector.\n \n \n \n \n Convert to double vector.\n \n \n \n \n Convert to float point.\n \n \n \n \n Convert to double point.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point3f to Point3i.\n \n \n \n \n \n Cast from Point3d to Point3i.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 4D point to 2D point.\n \n \n \n \n 4D point to 3D point.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components ofpoint finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as vector.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two points.\n \n \n \n \n Add a point and a vector.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Add a point and a vector.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point4f to Point4d.\n \n \n \n \n \n Cast from Point4i to Point4d.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n The first point.\n The second point.\n Should the vector be normalized.\n The vector from v0 to v1.\n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two points.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of 0.5.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 4D point to 2D point.\n \n \n \n \n 4D point to 3D point.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Are all the components of point finite.\n \n \n \n \n Make a point with no non finite conponents.\n \n \n \n \n Are any of the points components nan.\n \n \n \n \n Make a point with no nan conponents.\n \n \n \n \n Point as vector.\n \n \n \n \n Point as vector.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two points.\n \n \n \n \n Add a point and a vector.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract a point and a vector.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point4d to Point4f.\n \n \n \n \n \n Cast from Point4i to Point4f.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal given the error.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n Distance between two points.\n \n \n \n \n Square distance between two points.\n \n \n \n \n Direction between two points.\n \n The first point.\n The second point.\n Should the vector be normalized.\n The vector from v0 to v1.\n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two points.\n \n \n \n \n A rounded point.\n \n The number of digits to round to.\n The rounded point\n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Floor each component if point.\n \n \n \n \n Ceilling each component if point.\n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n The unit z point.\n \n \n \n \n The unit z point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of positive infinity.\n \n \n \n \n A point of negative infinity.\n \n \n \n \n 4D point to 2D point.\n \n \n \n \n 4D point to 3D point.\n \n \n \n \n A point all with the value v.\n \n \n \n \n A point from the varibles.\n \n \n \n \n Array accessor for variables. \n \n The variables index.\n The variable value\n \n \n \n Convert to float vector.\n \n \n \n \n Convert to double vector.\n \n \n \n \n Convert to float point.\n \n \n \n \n Convert to double point.\n \n \n \n \n The sum of the points components.\n \n \n \n \n The product of the points components.\n \n \n \n \n The points absolute values.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n Add two points.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Add point and scalar.\n \n \n \n \n Negate point.\n \n \n \n \n Subtract two points.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Subtract point and scalar.\n \n \n \n \n Multiply two points.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Multiply a point and a scalar.\n \n \n \n \n Divide two points.\n \n \n \n \n Divide a point and a scalar.\n \n \n \n \n Divide a scalar and a point.\n \n \n \n \n Cast from Point4f to Point4i.\n \n \n \n \n \n Cast from Point4d to Point4i.\n \n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points not equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Are these points equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The minimum value between s and each component in point.\n \n \n \n \n The minimum value between each component in points.\n \n \n \n \n The maximum value between s and each component in point.\n \n \n \n \n The maximum value between each component in points.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n A Quaternion from varibles.\n \n \n \n \n A Quaternion from a vector axis and angle.\n The axis is the up direction and the angle is the rotation.\n \n \n \n \n A quaternion with the rotation required to\n rotation from the from direction to the to direction.\n \n \n \n \n Returns the conjugate of a quaternion value.\n \n \n \n \n The inverse of the quaternion.\n \n \n \n \n The length of the quaternion.\n \n \n \n \n The sqr length of the quaternion.\n \n \n \n \n The a normalized quaternion.\n \n \n \n \n Subtract a quaternion and a scalar.\n \n \n \n \n Negate a quaternion.\n \n \n \n \n Subtract two quaternions.\n \n \n \n \n Add a quaternion and a scalar.\n \n \n \n \n Add two quaternions.\n \n \n \n \n Multiply a quaternion and a scalar.\n \n \n \n \n Divide a quaternion and a scalar.\n \n \n \n \n Multiply two quternions together.\n \n \n \n \n Multiply a quaternion and a vector together.\n \n \n \n \n Multiply a quaternion and a vector together.\n \n \n \n \n Are these Quaternions equal.\n \n \n \n \n Are these Quaternions not equal.\n \n \n \n \n Are these Quaternions equal.\n \n \n \n \n Are these Quaternions equal.\n \n \n \n \n Quaternions hash code. \n \n \n \n \n Quaternion as a string.\n \n \n \n \n Quaternion as a string.\n \n \n \n \n Convert to a single precision 3 dimension matrix.\n \n \n \n \n Convert to a single precision 4 dimension matrix.\n \n \n \n \n The normalize the quaternion.\n \n \n \n \n The dot product of two quaternion..\n \n \n \n \n Slerp the quaternion from the from rotation to the to rotation by t.\n \n \n \n \n Create a rotation out of a vector.\n Uses Unity euler axis (+x right, +y up, +z forward)\n \n \n \n \n Returns a 4x4 matrix that rotates around the x-axis by a given number of degrees.\n \n \n The clockwise rotation angle when looking along the x-axis towards the origin in degrees.\n \n \n \n \n Returns a 4x4 matrix that rotates around the y-axis by a given number of degrees.\n \n \n The clockwise rotation angle when looking along the y-axis towards the origin in degrees.\n \n \n \n \n Returns a 4x4 matrix that rotates around the z-axis by a given number of degrees.\n \n \n The clockwise rotation angle when looking along the z-axis towards the origin in degrees.\n \n \n \n \n A Quaternion from varibles.\n \n \n \n \n A Quaternion from varibles.\n \n \n \n \n A Quaternion from a vector axis and angle.\n The axis is the up direction and the angle is the rotation.\n \n \n \n \n A quaternion with the rotation required to\n rotation from the from direction to the to direction.\n \n \n \n \n Returns the conjugate of a quaternion value.\n \n \n \n \n The inverse of the quaternion.\n \n \n \n \n The length of the quaternion.\n \n \n \n \n The sqr length of the quaternion.\n \n \n \n \n The a normalized quaternion.\n \n \n \n \n Subtract a quaternion and a scalar.\n \n \n \n \n Subtract two quaternions.\n \n \n \n \n Negate a quaternion.\n \n \n \n \n Add a quaternion and a scalar.\n \n \n \n \n Add two quaternions.\n \n \n \n \n Multiply a quaternion and a scalar.\n \n \n \n \n Divide a quaternion and a scalar.\n \n \n \n \n Multiply two quaternions together.\n \n \n \n \n Multiply a quaternion and a vector together.\n \n \n \n \n Multiply a quaternion and a vector together.\n \n \n \n \n Are these Quaternions equal.\n \n \n \n \n Are these Quaternions not equal.\n \n \n \n \n Are these Quaternions equal.\n \n \n \n \n Are these Quaternions equal.\n \n \n \n \n Quaternions hash code. \n \n \n \n \n Quaternion as a string.\n \n \n \n \n Quaternion as a string.\n \n \n \n \n Convert to a single precision 3 dimension matrix.\n \n \n \n \n Convert to a single precision 4 dimension matrix.\n \n \n \n \n The normalize the quaternion.\n \n \n \n \n The dot product of two quaternion..\n \n \n \n \n Slerp the quaternion from the from rotation to the to rotation by t.\n \n \n \n \n Create a rotation out of a vector.\n Uses Unity euler axis (+x right, +y up, +z forward)\n \n \n \n \n Returns a 4x4 matrix that rotates around the x-axis by a given number of degrees.\n \n \n The clockwise rotation angle when looking along the x-axis towards the origin in degrees.\n \n \n \n \n Returns a 4x4 matrix that rotates around the y-axis by a given number of degrees.\n \n \n The clockwise rotation angle when looking along the y-axis towards the origin in degrees.\n \n \n \n \n Returns a 4x4 matrix that rotates around the z-axis by a given number of degrees.\n \n \n The clockwise rotation angle when looking along the z-axis towards the origin in degrees.\n \n \n \n \n Represents a angle in degrees.\n \n \n \n \n The angle in radians.\n \n \n \n \n The radian angle in degees.\n \n \n \n \n Pi.\n \n \n \n \n 0 degrees.\n \n \n \n \n 90 degrees.\n \n \n \n \n 90 degrees.\n \n \n \n \n 180 degrees.\n \n \n \n \n 270 degrees.\n \n \n \n \n 360 degrees.\n \n \n \n \n Create a new radian from a value.\n \n The angle in radians.\n \n \n \n Add two angles.\n \n \n \n \n Add angle and scalar.\n \n \n \n \n Negate the angle.\n \n \n \n \n Add angle and scalar.\n \n \n \n \n Subtract two angles.\n \n \n \n \n Subtract angle and scalar.\n \n \n \n \n Subtract angle and scalar.\n \n \n \n \n Multiply two angles.\n \n \n \n \n Multiply a angle and a scalar.\n \n \n \n \n Is the radian less than the scalar.\n \n \n \n \n Is the radian less than or equal to the scalar.\n \n \n \n \n Is the radian greater than the scalar.\n \n \n \n \n Is the radian greater than or equal to the scalar.\n \n \n \n \n Is the radian less than the other radian.\n \n \n \n \n Is the radian less than or equal to the other radian.\n \n \n \n \n Is the radian greater than the other radian.\n \n \n \n \n Is the radian greater than or equal to the other radian.\n \n \n \n \n Multiply a angle and a scalar.\n \n \n \n \n Cast from a degrees to radians.\n \n The angle in radians.\n \n \n \n Are these angles equal.\n \n \n \n \n Are these angles not equal.\n \n \n \n \n Are these angles equal.\n \n \n \n \n Are these angles equal.\n \n \n \n \n Angles hash code. \n \n \n \n \n Angles as a string.\n \n \n \n \n Angles as a string.\n \n \n \n \n A rounded angle.\n \n The number of digits to round to.\n The rounded angle\n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n A vector of 0.5.\n \n \n \n \n A vector of positive infinity.\n \n \n \n \n A vector of negative infinity.\n \n \n \n \n Convert to a 3 dimension vector.\n \n \n \n \n Convert to a 3 dimension vector.\n \n \n \n \n Convert to a 4 dimension vector.\n \n \n \n \n Convert to a 4 dimension vector.\n \n \n \n \n A vector all with the value v.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a vector with no non finite conponents.\n \n \n \n \n Are any of the vectors components nan.\n \n \n \n \n Make a vector with no nan conponents.\n \n \n \n \n Convert the vector to a point.\n \n \n \n \n The sum of the vectors components.\n \n \n \n \n The product of the vectors components.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n The vector normalized.\n \n \n \n \n Counter clock-wise perpendicular.\n \n \n \n \n Clock-wise perpendicular.\n \n \n \n \n The vectors absolute values.\n \n \n \n \n Add two vectors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Negate vector.\n \n \n \n \n Subtract two vectors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two vectors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two vectors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Divide a scalar and a vector.\n \n \n \n \n Cast from Vector2f to Vector2f.\n \n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors not equal.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors equal given the error.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Compare two vectors by axis.\n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The dot product of two vectors.\n \n \n \n \n The dot product of vector and point.\n \n \n \n \n The abs dot product of two vectors.\n \n \n \n \n Normalize the vector.\n \n \n \n \n Cross two vectors.\n \n \n \n \n Project vector v onto u.\n \n \n \n \n Given an incident vector i and a normal vector n.\n \n \n \n \n Returns the refraction vector given the incident vector i, \n the normal vector n and the refraction index eta.\n \n \n \n \n Angle between two vectors in degrees from 0 to 180.\n A and b origin treated as 0,0 and do not need to be normalized.\n \n \n \n \n Angle between two vectors in degrees from 0 to 360.\n Angle represents moving ccw from a to b.\n A and b origin treated as 0,0 and do not need to be normalized.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The minimum value between each component in vectors.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n The maximum value between each component in vectors.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Slerp between two vectors arc.\n \n \n \n \n Round vector.\n \n number of digits to round to.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Floor each component of vector.\n \n \n \n \n Ceilling each component of vector.\n \n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n A vector of 0.5.\n \n \n \n \n A vector of positive infinity.\n \n \n \n \n A vector of negative infinity.\n \n \n \n \n Convert to a 3 dimension vector.\n \n \n \n \n Convert to a 3 dimension vector.\n \n \n \n \n Convert to a 4 dimension vector.\n \n \n \n \n Convert to a 4 dimension vector.\n \n \n \n \n A vector all with the value v.\n \n \n \n \n A vector from the variables.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a vector with no non finite conponents.\n \n \n \n \n Are any of the vectors components nan.\n \n \n \n \n Make a vector with no nan conponents.\n \n \n \n \n Convert the vector to a point.\n \n \n \n \n The sum of the vectors components.\n \n \n \n \n The product of the vectors components.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n The vector normalized.\n \n \n \n \n Counter clock-wise perpendicular.\n \n \n \n \n Clock-wise perpendicular.\n \n \n \n \n The vectors absolute values.\n \n \n \n \n Add two vectors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Negate vector.\n \n \n \n \n Subtract two vectors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two vectors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two vectors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Divide a scalar and a vector.\n \n \n \n \n Cast from Vector2d to Vector2f.\n \n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors not equal.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors equal given the error.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Compare two vectors by axis.\n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The dot product of two vectors.\n \n \n \n \n The dot product of vector and point.\n \n \n \n \n The abs dot product of two vectors.\n \n \n \n \n Normalize the vector.\n \n \n \n \n Cross two vectors.\n \n \n \n \n Project vector v onto u.\n \n \n \n \n Given an incident vector i and a normal vector n.\n \n \n \n \n Returns the refraction vector given the incident vector i, \n the normal vector n and the refraction index eta.\n \n \n \n \n Angle between two vectors in degrees from 0 to 180.\n A and b origin treated as 0,0 and do not need to be normalized.\n \n \n \n \n Angle between two vectors in degrees from 0 to 360.\n Angle represents moving ccw from a to b.\n A and b origin treated as 0,0 and do not need to be normalized.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The minimum value between each component in vectors.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n The maximum value between each component in vectors.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Slerp between two vectors arc.\n \n \n \n \n Round vector.\n \n number of digits to round to.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Floor each component of vector.\n \n \n \n \n Ceilling each component of vector.\n \n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n The unit z vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n A vector of 0.5.\n \n \n \n \n A vector of positive infinity.\n \n \n \n \n A vector of negative infinity.\n \n \n \n \n 3D vector to 3D swizzle vector.\n \n \n \n \n 3D vector to 2D vector.\n \n \n \n \n 3D vector to 2D vector.\n \n \n \n \n 3D vector to 2D vector.\n \n \n \n \n 3D vector to 4D vector with w as 0.\n \n \n \n \n 3D vector to 4D vector with w as 1.\n \n \n \n \n A vector all with the value v.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n A vector from a 2d vector and the z varible.\n \n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a vector with no non finite conponents.\n \n \n \n \n Are any of the vectors components nan.\n \n \n \n \n Make a vector with no nan conponents.\n \n \n \n \n Convert the vector to a point.\n \n \n \n \n The sum of the vectors components.\n \n \n \n \n The product of the vectors components.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n The vector normalized.\n \n \n \n \n The vectors absolute values.\n \n \n \n \n Convert a normalized vector to tangent space.\n \n \n \n \n Add two vectors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Negate vector.\n \n \n \n \n Subtract two vectors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two vectors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two vectors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Divide a scalar and a vector.\n \n \n \n \n Cast from Vector3f to Vector3d.\n \n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors not equal.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors equal given the error.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Compare two vectors by axis.\n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The dot product of two vectors.\n \n \n \n \n The dot product of vector and point.\n \n \n \n \n The abs dot product of two vectors.\n \n \n \n \n Normalize the vector.\n \n \n \n \n Angle between two vectors in degrees from 0 to 180.\n A and b origin treated as 0,0 and do not need to be normalized.\n \n \n \n \n Cross two vectors.\n \n \n \n \n Cross two vectors.\n \n \n \n \n Cross a vector andpoint.\n \n \n \n \n Cross two points.\n \n \n \n \n Project vector v onto u.\n \n \n \n \n Given an incident vector i and a normal vector n.\n \n \n \n \n Returns the refraction vector given the incident vector i, \n the normal vector n and the refraction index eta.\n \n \n \n \n Create a set of orthonormal vectors.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The minimum value between each component in vectors.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n The maximum value between each component in vectors.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Slerp between two vectors arc.\n \n \n \n \n Round vector.\n \n number of digits to round to.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Floor each component of vector.\n \n \n \n \n Ceilling each component of vector.\n \n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n The unit z vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n A vector of 0.5.\n \n \n \n \n A vector of positive infinity.\n \n \n \n \n A vector of negative infinity.\n \n \n \n \n 3D vector to 3D swizzle vector.\n \n \n \n \n 3D vector to 2D vector.\n \n \n \n \n 3D vector to 2D vector.\n \n \n \n \n 3D vector to 2D vector.\n \n \n \n \n 3D vector to 4D vector with w as 0.\n \n \n \n \n 3D vector to 4D vector with w as 1.\n \n \n \n \n A vector all with the value v.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n A vector from a 2d vector and the z varible.\n \n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a vector with no non finite conponents.\n \n \n \n \n Are any of the vectors components nan.\n \n \n \n \n Make a vector with no nan conponents.\n \n \n \n \n Convert the vector to a point.\n \n \n \n \n The sum of the vectors components.\n \n \n \n \n The product of the vectors components.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n The vector normalized.\n \n \n \n \n The vectors absolute values.\n \n \n \n \n Convert a normalized vector to tangent space.\n \n \n \n \n Add two vectors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Negate vector.\n \n \n \n \n Subtract two vectors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two vectors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two vectors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Divide a scalar and a vector.\n \n \n \n \n Cast from Vector3d to Vector3f.\n \n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors not equal.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors equal given the error.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Compare two vectors by axis.\n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The dot product of two vectors.\n \n \n \n \n The dot product of vector and point.\n \n \n \n \n The abs dot product of two vectors.\n \n \n \n \n Normalize the vector.\n \n \n \n \n Angle between two vectors in degrees from 0 to 180.\n A and b origin treated as 0,0 and do not need to be normalized.\n \n \n \n \n Cross two vectors.\n \n \n \n \n Cross two vectors.\n \n \n \n \n Cross a vector andpoint.\n \n \n \n \n Cross two points.\n \n \n \n \n Project vector v onto u.\n \n \n \n \n Given an incident vector i and a normal vector n.\n \n \n \n \n Returns the refraction vector given the incident vector i, \n the normal vector n and the refraction index eta.\n \n \n \n \n Create a set of orthonormal vectors.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The minimum value between each component in vectors.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n The maximum value between each component in vectors.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Slerp between two vectors arc.\n \n \n \n \n Round vector.\n \n number of digits to round to.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Floor each component of vector.\n \n \n \n \n Ceilling each component of vector.\n \n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n The unit z vector.\n \n \n \n \n The unit w vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n A vector of 0.5.\n \n \n \n \n A vector of positive infinity.\n \n \n \n \n A vector of negative infinity.\n \n \n \n \n Convert to a 2 dimension vector.\n \n \n \n \n Convert to a 2 dimension vector.\n \n \n \n \n Convert to a 3 dimension vector.\n \n \n \n \n A copy of the vector with w as 0.\n \n \n \n \n A vector all with the value v.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n A vector from a 2d vector and the z and w varibles.\n \n \n \n \n A vector from a 3d vector and the w varible.\n \n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a vector with no non finite conponents.\n \n \n \n \n Are any of the vectors components nan.\n \n \n \n \n Make a vector with no nan conponents.\n \n \n \n \n Convert the vector to a point.\n \n \n \n \n The sum of the vectors components.\n \n \n \n \n The product of the vectors components.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n The vector normalized.\n \n \n \n \n The vectors absolute values.\n \n \n \n \n Add two vectors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Negate vector.\n \n \n \n \n Subtract two vectors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two vectors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two vectors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Divide a scalar and a vector.\n \n \n \n \n Cast from Vector4f to Vector4d.\n \n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors not equal.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors equal given the error.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Compare two vectors by axis.\n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The dot product of two vectors.\n \n \n \n \n The dot product of vector and point.\n \n \n \n \n The abs dot product of two vectors.\n \n \n \n \n Normalize the vector.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The minimum value between each component in vectors.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n The maximum value between each component in vectors.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Round vector.\n \n number of digits to round to.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Floor each component of vector.\n \n \n \n \n Ceilling each component of vector.\n \n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n The unit z vector.\n \n \n \n \n The unit w vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n A vector of 0.5.\n \n \n \n \n A vector of positive infinity.\n \n \n \n \n A vector of negative infinity.\n \n \n \n \n Convert to a 2 dimension vector.\n \n \n \n \n Convert to a 2 dimension vector.\n \n \n \n \n Convert to a 3 dimension vector.\n \n \n \n \n A copy of the vector with w as 0.\n \n \n \n \n A vector all with the value v.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n A vector from the varibles.\n \n \n \n \n A vector from a 2d vector and the z and w varibles.\n \n \n \n \n A vector from a 3d vector and the w varible.\n \n \n \n \n Are all the components of vector finite.\n \n \n \n \n Make a vector with no non finite conponents.\n \n \n \n \n Are any of the vectors components nan.\n \n \n \n \n Make a vector with no nan conponents.\n \n \n \n \n Convert the vector to a point.\n \n \n \n \n The sum of the vectors components.\n \n \n \n \n The product of the vectors components.\n \n \n \n \n The length of the vector.\n \n \n \n \n The length of the vector squared.\n \n \n \n \n The vector normalized.\n \n \n \n \n The vectors absolute values.\n \n \n \n \n Add two vectors.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Add vector and scalar.\n \n \n \n \n Negate vector.\n \n \n \n \n Subtract two vectors.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Subtract vector and scalar.\n \n \n \n \n Multiply two vectors.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Multiply a vector and a scalar.\n \n \n \n \n Divide two vectors.\n \n \n \n \n Divide a vector and a scalar.\n \n \n \n \n Divide a scalar and a vector.\n \n \n \n \n Cast from Vector4d to Vector4f.\n \n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors not equal.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Are these vectors equal given the error.\n \n \n \n \n Are these vectors equal.\n \n \n \n \n Vectors hash code. \n \n \n \n \n Compare two vectors by axis.\n \n \n \n \n Vector as a string.\n \n \n \n \n Vector as a string.\n \n \n \n \n The dot product of two vectors.\n \n \n \n \n The dot product of vector and point.\n \n \n \n \n The abs dot product of two vectors.\n \n \n \n \n Normalize the vector.\n \n \n \n \n The minimum value between s and each component in vector.\n \n \n \n \n The minimum value between each component in vectors.\n \n \n \n \n The maximum value between s and each component in vector.\n \n \n \n \n The maximum value between each component in vectors.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Clamp each component to specified min and max.\n \n \n \n \n Lerp between two vectors.\n \n \n \n \n Round vector.\n \n number of digits to round to.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Floor each component of vector.\n \n \n \n \n Ceilling each component of vector.\n \n \n \n \n A 2D box represented by its min and max values.\n \n \n \n \n The boxes min point.\n \n \n \n \n The boxes max point.\n \n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n The boxes lower left corner.\n \n \n \n \n The boxes lower right corner.\n \n \n \n \n The boxes upper right corner.\n \n \n \n \n The boxes upper left corner.\n \n \n \n \n The center of the box.\n \n \n \n \n The size of the boxes sides.\n \n \n \n \n The size of the box on the x axis.\n \n \n \n \n The size of the box on the y axis.\n \n \n \n \n The area of the box.\n \n \n \n \n Is the box equal to this obj.\n \n The object.\n Is the box equal to this obj.\n \n \n \n Is the box equal to the other box.\n \n The other box.\n Is the box equal to the other box.\n \n \n \n The boxes hash code.\n \n The boxes hash code.\n \n \n \n \n \n \n \n \n \n Get the boxes corner points as a array.\n \n The boxes corner points as a array\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 4.\n \n \n \n Copy the boxes corner points in the array.\n Convert the 2d points into 3d points with the\n y component now as the z component.\n \n A array that has a size of at least 4.\n The 3d points y value.\n \n \n \n Returns the bounding box containing this box and the given point.\n \n \n \n \n Returns the bounding box containing this box and the given box.\n \n \n \n \n Return a new box expanded by the amount.\n \n The box to expand.\n The amount to expand.\n The expanded box.\n \n \n \n Returns true if this box intersects the other box.\n \n The other box.\n True if on border counts as inside.\n Returns true if this box intersects the other box.\n \n \n \n Does the box fully contain the other box.\n \n The other box.\n True if on border counts as inside.\n Does the box fully contain the other box.\n \n \n \n Does the box contain the point.\n \n The point.\n True if on border counts as inside.\n True if the box contains the point.\n \n \n \n Find the closest point to the box.\n If point inside box return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside box field is positive.\n If point is inside box field is negative.\n \n \n \n \n Round the boxes components.\n \n The number of digits to round to.\n \n \n \n Caculate the bounding box of the points.\n \n The points.\n The bounding box.\n \n \n \n Calculate the bounds of 2 points.\n \n The first point.\n The second point\n The bounding box.\n \n \n \n Caculate the bounding box of a set of segments.\n \n The segments.\n The bounding box\n \n \n \n A 2D box represented by its min and max values.\n \n \n \n \n The boxes min point.\n \n \n \n \n The boxes max point.\n \n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n The boxes lower left corner.\n \n \n \n \n The boxes lower right corner.\n \n \n \n \n The boxes upper right corner.\n \n \n \n \n The boxes upper left corner.\n \n \n \n \n The center of the box.\n \n \n \n \n The size of the boxes sides.\n \n \n \n \n The size of the box on the x axis.\n \n \n \n \n The size of the box on the y axis.\n \n \n \n \n The area of the box.\n \n \n \n \n Is the box equal to this obj.\n \n The object.\n Is the box equal to this obj.\n \n \n \n Is the box equal to the other box.\n \n The other box.\n Is the box equal to the other box.\n \n \n \n The boxes hash code.\n \n The boxes hash code.\n \n \n \n \n \n \n \n \n \n Get the boxes corner points as a array.\n \n The boxes corner points as a array\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 4.\n \n \n \n Copy the boxes corner points in the array.\n Convert the 2f points into 3f points with the\n y component now as the z component.\n \n A array that has a size of at least 4.\n The 3f points y value.\n \n \n \n Returns the bounding box containing this box and the given point.\n \n \n \n \n Returns the bounding box containing this box and the given box.\n \n \n \n \n Return a new box expanded by the amount.\n \n The box to expand.\n The amount to expand.\n The expanded box.\n \n \n \n Returns true if this box intersects the other box.\n \n The other box.\n True if on border counts as inside.\n Returns true if this box intersects the other box.\n \n \n \n Does the box fully contain the other box.\n \n The other box.\n True if on border counts as inside.\n Does the box fully contain the other box.\n \n \n \n Does the box contain the point.\n \n The point.\n True if on border counts as inside.\n True if the box contains the point.\n \n \n \n Find the closest point to the box.\n If point inside box return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside box field is positive.\n If point is inside box field is negative.\n \n \n \n \n Round the boxes components.\n \n The number of digits to round to.\n \n \n \n Caculate the bounding box of the points.\n \n The points.\n The bounding box.\n \n \n \n Calculate the bounds of 2 points.\n \n The first point.\n The second point\n The bounding box.\n \n \n \n Caculate the bounding box of a set of segments.\n \n The segments.\n The bounding box\n \n \n \n A 2D box represented by its min and max values.\n \n \n \n \n The boxes min point.\n \n \n \n \n The boxes max point.\n \n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n The boxes lower left corner.\n \n \n \n \n The boxes lower right corner.\n \n \n \n \n The boxes upper right corner.\n \n \n \n \n The boxes upper left corner.\n \n \n \n \n The center of the box.\n \n \n \n \n The size of the boxes sides.\n \n \n \n \n The size of the box on the x axis.\n \n \n \n \n The size of the box on the y axis.\n \n \n \n \n The area of the box.\n \n \n \n \n Enumerate each point on the boxes perimeter.\n \n \n \n \n \n Enumerate each point in the box.\n \n \n \n \n \n Is the box equal to this obj.\n \n The object.\n Is the box equal to this obj.\n \n \n \n Is the box equal to the other box.\n \n The other box.\n Is the box equal to the other box.\n \n \n \n The boxes hash code.\n \n The boxes hash code.\n \n \n \n \n \n \n \n \n \n Get the boxes corner points as a array.\n \n The boxes corner points as a array\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 4.\n \n \n \n Copy the boxes corner points in the array.\n Convert the 2i points into 3i points with the\n y component now as the z component.\n \n A array that has a size of at least 4.\n The 3i points y value.\n \n \n \n Returns the bounding box containing this box and the given point.\n \n \n \n \n Returns the bounding box containing this box and the given box.\n \n \n \n \n Return a new box expanded by the amount.\n \n The box to expand.\n The amount to expand.\n The expanded box.\n \n \n \n Returns true if this box intersects the other box.\n \n The other box.\n True if on border counts as inside.\n Returns true if this box intersects the other box.\n \n \n \n Does the box fully contain the other box.\n \n The other box.\n True if on border counts as inside.\n Does the box fully contain the other box.\n \n \n \n Does the box contain the point.\n \n The point.\n True if on border counts as inside.\n True if the box contains the point.\n \n \n \n Find the closest point to the box.\n If point inside box return point.\n \n \n \n \n Caculate the bounding box of the points.\n \n The points.\n The bounding box.\n \n \n \n Calculate the bounds of 2 points.\n \n The first point.\n The second point\n The bounding box.\n \n \n \n A 3D box represented by its min and max values.\n \n \n \n \n The boxes min point.\n \n \n \n \n The boxes max point.\n \n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n The center of the box.\n \n \n \n \n The size of the boxes sides.\n \n \n \n \n The size of the box on the x axis.\n \n \n \n \n The size of the box on the y axis.\n \n \n \n \n The size of the box on the z axis.\n \n \n \n \n The volume of the box.\n \n \n \n \n THe boxes surface area.\n \n \n \n \n Is the box equal to this obj.\n \n The object.\n Is the box equal to this obj.\n \n \n \n Is the box equal to the other box.\n \n The other box.\n Is the box equal to the other box.\n \n \n \n The boxes hash code.\n \n The boxes hash code.\n \n \n \n \n \n \n \n \n \n Get the boxes corner points as a array.\n \n The boxes corner points as a array\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 8.\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 8.\n \n \n \n Returns the bounding box containing this box and the given point.\n \n \n \n \n Returns the bounding box containing this box and the given box.\n \n \n \n \n Return a new box expanded by the amount.\n \n The box to expand.\n The amount to expand.\n The expanded box.\n \n \n \n Returns true if this box intersects the other box.\n \n The other box.\n True if on border counts as inside.\n Returns true if this box intersects the other box.\n \n \n \n Does the box fully contain the other box.\n \n The other box.\n True if on border counts as inside.\n Does the box fully contain the other box.\n \n \n \n Does the box contain the point.\n \n The point.\n True if on border counts as inside.\n True if the box contains the point.\n \n \n \n Find the closest point to the box.\n If point inside box return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside box field is positive.\n If point is inside box field is negative.\n \n \n \n \n Round the boxes components.\n \n The number of digits to round to.\n \n \n \n Caculate the bounding box of the points.\n \n The points.\n The bounding box.\n \n \n \n Calculate the bounds of 2 points.\n \n The first point.\n The second point\n The bounding box.\n \n \n \n Caculate the bounding box of a set of segments.\n \n The segments.\n The bounding box\n \n \n \n A 3D box represented by its min and max values.\n \n \n \n \n The boxes min point.\n \n \n \n \n The boxes max point.\n \n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n The center of the box.\n \n \n \n \n The size of the boxes sides.\n \n \n \n \n The size of the box on the x axis.\n \n \n \n \n The size of the box on the y axis.\n \n \n \n \n The size of the box on the z axis.\n \n \n \n \n The volume of the box.\n \n \n \n \n THe boxes surface area.\n \n \n \n \n Is the box equal to this obj.\n \n The object.\n Is the box equal to this obj.\n \n \n \n Is the box equal to the other box.\n \n The other box.\n Is the box equal to the other box.\n \n \n \n The boxes hash code.\n \n The boxes hash code.\n \n \n \n \n \n \n \n \n \n Get the boxes corner points as a array.\n \n The boxes corner points as a array\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 8.\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 8.\n \n \n \n Returns the bounding box containing this box and the given point.\n \n \n \n \n Returns the bounding box containing this box and the given box.\n \n \n \n \n Return a new box expanded by the amount.\n \n The box to expand.\n The amount to expand.\n The expanded box.\n \n \n \n Returns true if this box intersects the other box.\n \n The other box.\n True if on border counts as inside.\n Returns true if this box intersects the other box.\n \n \n \n Does the box fully contain the other box.\n \n The other box.\n True if on border counts as inside.\n Does the box fully contain the other box.\n \n \n \n Does the box contain the point.\n \n The point.\n True if on border counts as inside.\n True if the box contains the point.\n \n \n \n Find the closest point to the box.\n If point inside box return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside box field is positive.\n If point is inside box field is negative.\n \n \n \n \n Round the boxes components.\n \n The number of digits to round to.\n \n \n \n Caculate the bounding box of the points.\n \n The points.\n The bounding box.\n \n \n \n Calculate the bounds of 2 points.\n \n The first point.\n The second point\n The bounding box.\n \n \n \n Caculate the bounding box of a set of segments.\n \n The segments.\n The bounding box\n \n \n \n A 3D box represented by its min and max values.\n \n \n \n \n The boxes min point.\n \n \n \n \n The boxes max point.\n \n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n Construct a new box.\n \n The boxes min point.\n The boxes max point.\n \n \n \n The center of the box.\n \n \n \n \n The size of the boxes sides.\n \n \n \n \n The size of the box on the x axis.\n \n \n \n \n The size of the box on the y axis.\n \n \n \n \n The size of the box on the z axis.\n \n \n \n \n The volume of the box.\n \n \n \n \n THe boxes surface area.\n \n \n \n \n Is the box equal to this obj.\n \n The object.\n Is the box equal to this obj.\n \n \n \n Is the box equal to the other box.\n \n The other box.\n Is the box equal to the other box.\n \n \n \n The boxes hash code.\n \n The boxes hash code.\n \n \n \n \n \n \n \n \n \n Get the boxes corner points as a array.\n \n The boxes corner points as a array\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 8.\n \n \n \n Copy the boxes corner points in the array.\n \n A array that has a size of at least 8.\n \n \n \n Returns the bounding box containing this box and the given point.\n \n \n \n \n Returns the bounding box containing this box and the given box.\n \n \n \n \n Return a new box expanded by the amount.\n \n The box to expand.\n The amount to expand.\n The expanded box.\n \n \n \n Returns true if this box intersects the other box.\n \n The other box.\n True if on border counts as inside.\n Returns true if this box intersects the other box.\n \n \n \n Does the box fully contain the other box.\n \n The other box.\n True if on border counts as inside.\n Does the box fully contain the other box.\n \n \n \n Does the box contain the point.\n \n The point.\n True if on border counts as inside.\n True if the box contains the point.\n \n \n \n Find the closest point to the box.\n If point inside box return point.\n \n \n \n \n Caculate the bounding box of the points.\n \n The points.\n The bounding box.\n \n \n \n Calculate the bounds of 2 points.\n \n The first point.\n The second point\n The bounding box.\n \n \n \n The squared radius.\n \n \n \n \n The circles diameter.\n \n \n \n \n The circles area.\n \n \n \n \n the circles circumference.\n \n \n \n \n Calculate the bounding box.\n \n \n \n \n The circles hashcode.\n \n The circles hashcode.\n \n \n \n \n \n \n \n \n \n Find the closest point to the circle.\n If point inside circle return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside circle field is positive.\n If point is inside circle field is negative.\n \n \n \n \n Does the circle contain the point.\n \n The point.\n Does the border conunt as inside the circle.\n true if circle contains point\n \n \n \n Does the circle fully contain the box.\n \n The box.\n Does the border conunt as inside the circle.\n Does the circle fully contain the box.\n \n \n \n Does this circle intersect with the other circle.\n \n The other circle\n Does the border conunt as inside the circle.\n True if the circles intersect\n \n \n \n Does the circle intersect the box.\n \n The box.\n Does the border conunt as inside the circle.\n Does the circle intersect the box.\n \n \n \n Enlarge the circle so it contains the point p.\n \n \n \n \n Returns true if the point d is inside the circle defined by the points a, b, c.\n \n \n \n \n Creates a circle that has both points on its circumference.\n \n \n \n \n Creates a circle that has all 3 points on its circumference.\n From MathWorld: http://mathworld.wolfram.com/Circumcircle.html.\n Fails if the points are colinear.\n \n \n \n \n Creates a circle that contains all three point.\n \n \n \n \n Calculate the bounding circle that contains \n all the points in the list.\n \n \n \n \n Finds which axis contains the two most extreme points\n \n \n \n \n The squared radius.\n \n \n \n \n The circles diameter.\n \n \n \n \n The circles area.\n \n \n \n \n the circles circumference.\n \n \n \n \n Calculate the bounding box.\n \n \n \n \n The circles hashcode.\n \n The circles hashcode.\n \n \n \n \n \n \n \n \n \n Find the closest point to the circle.\n If point inside circle return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside circle field is positive.\n If point is inside circle field is negative.\n \n \n \n \n Does the circle contain the point.\n \n The point.\n Does the border conunt as inside the circle.\n true if circle contains point\n \n \n \n Does the circle fully contain the box.\n \n The box.\n Does the border conunt as inside the circle.\n Does the circle fully contain the box.\n \n \n \n Does this circle intersect with the other circle.\n \n The other circle\n Does the border conunt as inside the circle.\n True if the circles intersect\n \n \n \n Does the circle intersect the box.\n \n The box.\n Does the border conunt as inside the circle.\n Does the circle intersect the box.\n \n \n \n Enlarge the circle so it contains the point p.\n \n \n \n \n Returns true if the point d is inside the circle defined by the points a, b, c.\n \n \n \n \n Creates a circle that has both points on its circumference.\n \n \n \n \n Creates a circle that has all 3 points on its circumference.\n From MathWorld: http://mathworld.wolfram.com/Circumcircle.html.\n Fails if the points are colinear.\n \n \n \n \n Creates a circle that contains all three point.\n \n \n \n \n Calculate the bounding circle that contains \n all the points in the list.\n \n \n \n \n Finds which axis contains the two most extreme points\n \n \n \n \n Represents a line from three coefficients\n a, b and c, where ax + by + c = 0 holds.\n \n \n \n \n Create a new line from three coefficients\n a, b and c, where ax + by + c = 0 holds.\n \n The constant in ax.\n The constant in by\n The constant c\n \n \n \n Create a new line from the slope and the y \n intercept, where y = mx + b holds.\n \n The lines slope.\n The y intercept.\n \n \n \n Create a new line that passes through the two points.\n \n Point 1.\n Point 2.\n \n \n \n Find the slope of the line.\n \n \n \n \n Determines whether the line is ascending\n (that is, makes an angle with the positive\n direction of the X axis that lies in (0, pi/2).\n \n \n \n \n Determines whether the line is vertical\n (that is, makes an angle with the positive\n direction of the X axis that is equal to pi/2.\n \n \n \n \n Determines whether the line is descending\n (that is, makes an angle with the positive\n direction of the X axis that lies in (pi/2, pi).\n \n \n \n \n Determines whether the line is horizontal\n (that is, makes an angle with the positive\n direction of the X axis that is equal to pi.\n \n \n \n \n Determines whether the line is undefined\n (e.g.two equal points were passed to the constructor).\n \n \n \n \n Calculates the angle that the line makes\n with the positive direction of the X axis.\n \n \n \n \n \n Is the line equal to the other object.\n \n The other object.\n Is the line equal to the other object.\n \n \n \n Is the line equal to the other line.\n \n The other line.\n Is the line equal to the other line.\n \n \n \n The lines hash code.\n \n The lines hash code.\n \n \n \n \n \n \n \n \n \n Calculates the X coordinate of a point on the line by its Y coordinate.\n \n \n \n \n Calculates the Y coordinate of a point on the line by its X coordinate.\n \n \n \n \n Determines whether the point lies on the line.\n \n \n if the point lies on the line\n \n \n \n Calculates the perpendicular line that\n passes through the given point.\n \n \n \n \n Determines whether the point lies\n on the left side of the line.\n \n \n \n \n Determines whether the point lies\n on the right side of the line.\n \n \n \n \n Determine if the two lines are the equivalent\n even though they may have a different equation.\n \n \n \n \n \n \n Calculates the intersection of two lines.\n \n the other line\n intersection point\n if lines intersect\n \n \n \n Represents a line from three coefficients\n a, b and c, where ax + by + c = 0 holds.\n \n \n \n \n Create a new line from three coefficients\n a, b and c, where ax + by + c = 0 holds.\n \n The constant in ax.\n The constant in by\n The constant c\n \n \n \n Create a new line from the slope and the y \n intercept, where y = mx + b holds.\n \n The lines slope.\n The y intercept.\n \n \n \n Create a new line that passes through the two points.\n \n Point 1.\n Point 2.\n \n \n \n Find the slope of the line.\n \n \n \n \n Determines whether the line is ascending\n (that is, makes an angle with the positive\n direction of the X axis that lies in (0, pi/2).\n \n \n \n \n Determines whether the line is vertical\n (that is, makes an angle with the positive\n direction of the X axis that is equal to pi/2.\n \n \n \n \n Determines whether the line is descending\n (that is, makes an angle with the positive\n direction of the X axis that lies in (pi/2, pi).\n \n \n \n \n Determines whether the line is horizontal\n (that is, makes an angle with the positive\n direction of the X axis that is equal to pi.\n \n \n \n \n Determines whether the line is undefined\n (e.g.two equal points were passed to the constructor).\n \n \n \n \n Calculates the angle that the line makes\n with the positive direction of the X axis.\n \n \n \n \n \n Is the line equal to the other object.\n \n The other object.\n Is the line equal to the other object.\n \n \n \n Is the line equal to the other line.\n \n The other line.\n Is the line equal to the other line.\n \n \n \n The lines hash code.\n \n The lines hash code.\n \n \n \n \n \n \n \n \n \n Calculates the X coordinate of a point on the line by its Y coordinate.\n \n \n \n \n Calculates the Y coordinate of a point on the line by its X coordinate.\n \n \n \n \n Determines whether the point lies on the line.\n \n \n if the point lies on the line\n \n \n \n Calculates the perpendicular line that\n passes through the given point.\n \n \n \n \n Determines whether the point lies\n on the left side of the line.\n \n \n \n \n Determines whether the point lies\n on the right side of the line.\n \n \n \n \n Determine if the two lines are the equivalent\n even though they may have a different equation.\n \n \n \n \n \n \n Calculates the intersection of two lines.\n \n the other line\n intersection point\n if lines intersect\n \n \n \n A 3D Line struct represented by a position and a direction.\n \n \n \n \n The Lines position.\n \n \n \n \n The Lines direction.\n Might not be normalized.\n \n \n \n \n Construct a Line from a point and the direction.\n \n The Lines position.\n The Lines direction (will be normalized)\n \n \n \n Check if the two Lines are equal.\n \n The first Line.\n The second Line.\n True if the two Lines are equal.\n \n \n \n Check if the two Lines are not equal.\n \n The first Line.\n The second Line.\n True if the two Lines are not equal.\n \n \n \n Is the Line equal to this object.\n \n The object.\n Is the Line equal to this object.\n \n \n \n Is the Line equal to the other Line.\n \n The over Line.\n Is the Line equal to the other Line.\n \n \n \n The Lines hashcode.\n \n The Lines hashcode.\n \n \n \n The Lines as a string.\n \n \n \n \n \n Normalize the lines direction.\n \n \n \n \n Round the Lines position and direction.\n \n number of digits to round to.\n \n \n \n A 3f Line struct represented by a position and a direction.\n \n \n \n \n The Lines position.\n \n \n \n \n The Lines direction.\n Might not be normalized.\n \n \n \n \n Construct a Line from a point and the direction.\n \n The Lines position.\n The Lines direction (will be normalized)\n \n \n \n Check if the two Lines are equal.\n \n The first Line.\n The second Line.\n True if the two Lines are equal.\n \n \n \n Check if the two Lines are not equal.\n \n The first Line.\n The second Line.\n True if the two Lines are not equal.\n \n \n \n Is the Line equal to this object.\n \n The object.\n Is the Line equal to this object.\n \n \n \n Is the Line equal to the other Line.\n \n The over Line.\n Is the Line equal to the other Line.\n \n \n \n The Lines hashcode.\n \n The Lines hashcode.\n \n \n \n The Lines as a string.\n \n \n \n \n \n Normalize the lines direction.\n \n \n \n \n Round the Lines position and direction.\n \n number of digits to round to.\n \n \n \n Plane struct defined by a position and direction.\n \n \n \n \n A plane facing the x axis.\n \n \n \n \n A plane facing the y axis.\n \n \n \n \n A plane facing the z axis.\n \n \n \n \n The planes position.\n \n \n \n \n The planes direction.\n \n \n \n \n Create a new plane.\n \n The planes direction.\n \n \n \n Create a new plane.\n \n The planes position.\n The planes direction.\n \n \n \n Create a new plane.\n \n The planes direction.\n The planes distance from the origin.\n \n \n \n From three noncollinear points (ordered ccw).\n \n \n \n \n \n \n \n The planes distance from the origin.\n \n \n \n \n The planes square distance from the origin.\n \n \n \n \n Check if the two planes are equal.\n \n The first plane.\n The second plane.\n True if the planes are equal.\n \n \n \n Check if the two planes are not equal.\n \n The first plane.\n The second plane.\n True if the planes are not equal.\n \n \n \n Check if this plane is equal to the other object.\n \n The other object.\n Are these planes equal.\n \n \n \n Check if this plane is equal to the other plane.\n \n The other plane.\n Are these planes equal.\n \n \n \n The planes hash code.\n \n \n \n \n \n The plane as a string.\n \n \n \n \n \n The closest point on the plane to the point p.\n \n The point.\n The closest point on the plane.\n \n \n \n Plane struct defined by a position and direction.\n \n \n \n \n A plane facing the x axis.\n \n \n \n \n A plane facing the y axis.\n \n \n \n \n A plane facing the z axis.\n \n \n \n \n The planes position.\n \n \n \n \n The planes direction.\n \n \n \n \n Create a new plane.\n \n The planes direction.\n \n \n \n Create a new plane.\n \n The planes position.\n The planes direction.\n \n \n \n Create a new plane.\n \n The planes direction.\n The planes distance from the origin.\n \n \n \n From three noncollinear points (ordered ccw).\n \n \n \n \n \n \n \n The planes distance from the origin.\n \n \n \n \n The planes square distance from the origin.\n \n \n \n \n Check if the two planes are equal.\n \n The first plane.\n The second plane.\n True if the planes are equal.\n \n \n \n Check if the two planes are not equal.\n \n The first plane.\n The second plane.\n True if the planes are not equal.\n \n \n \n Check if this plane is equal to the other object.\n \n The other object.\n Are these planes equal.\n \n \n \n Check if this plane is equal to the other plane.\n \n The other plane.\n Are these planes equal.\n \n \n \n The planes hash code.\n \n \n \n \n \n The plane as a string.\n \n \n \n \n \n The closest point on the plane to the point p.\n \n The point.\n The closest point on the plane.\n \n \n \n A 2D ray.\n \n \n \n \n The rays position.\n \n \n \n \n The rays direction.\n \n \n \n \n Construct a new ray.\n \n The rays position.\n The rays directio\n \n \n \n Is the ray equal to the other object.\n \n The other object.\n Is the ray equal to the other object.\n \n \n \n Is the ray equal to the other ray.\n \n The other ray.\n Is the ray equal to the other ray.\n \n \n \n The rays hashcode.\n \n The rays hashcode.\n \n \n \n \n \n \n \n \n \n Round the rays components.\n \n The number of digits to round to.\n \n \n \n Get the position offset along the ray at t.\n \n The amount to offset.\n The position at t.\n \n \n \n Intersection point between two rays.\n Presumes there is a intersection.\n \n The other ray.\n \n \n \n \n Intersection between two rays.\n \n The other ray\n Intersection point = Position + s * Direction.\n Intersection point = ray.Position + t * ray.Direction.\n If rays intersect\n \n \n \n Intersection between ray and segment.\n \n the segment\n Intersection point = Position + s * Direction\n Intersection point = A + t * (B - A)\n If rays intersect\n \n \n \n Intersection between ray and circle.\n \n the circle\n Intersection point = Position + t * Direction\n If rays intersect\n \n \n \n Intersection between ray and box.\n \n the box\n Intersection point = Position + t * Direction\n If rays intersect\n \n \n \n A 2D ray.\n \n \n \n \n The rays position.\n \n \n \n \n The rays direction.\n \n \n \n \n Construct a new ray.\n \n The rays position.\n The rays directio\n \n \n \n Is the ray equal to the other object.\n \n The other object.\n Is the ray equal to the other object.\n \n \n \n Is the ray equal to the other ray.\n \n The other ray.\n Is the ray equal to the other ray.\n \n \n \n The rays hashcode.\n \n The rays hashcode.\n \n \n \n \n \n \n \n \n \n Get the position offset along the ray at t.\n \n The amount to offset.\n The position at t.\n \n \n \n Intersection point between two rays.\n Presumes there is a intersection.\n \n The other ray.\n \n \n \n \n Intersection between two rays.\n \n The other ray\n Intersection point = Position + s * Direction.\n Intersection point = ray.Position + t * ray.Direction.\n If rays intersect\n \n \n \n Intersection between ray and segment.\n \n the segment\n Intersection point = Position + s * Direction\n Intersection point = A + t * (B - A)\n If rays intersect\n \n \n \n Intersection between ray and circle.\n \n the circle\n Intersection point = Position + t * Direction\n If rays intersect\n \n \n \n Intersection between ray and box.\n \n the box\n Intersection point = Position + t * Direction\n If rays intersect\n \n \n \n A 3D ray struct represented by a position and a direction.\n \n \n \n \n The rays position.\n \n \n \n \n The rays direction.\n Might not be normalized.\n \n \n \n \n Construct a ray from a point and the direction.\n \n The rays position.\n The rays direction (will be normalized)\n \n \n \n Check if the two rays are equal.\n \n The first ray.\n The second ray.\n True if the two rays are equal.\n \n \n \n Check if the two rays are not equal.\n \n The first ray.\n The second ray.\n True if the two rays are not equal.\n \n \n \n Is the ray equal to this object.\n \n The object.\n Is the ray equal to this object.\n \n \n \n Is the ray equal to the other ray.\n \n The over ray.\n Is the ray equal to the other ray.\n \n \n \n The rays hashcode.\n \n The rays hashcode.\n \n \n \n The rays as a string.\n \n \n \n \n \n The rays directions magnidute.\n \n \n \n \n The rays directions square magnidute.\n \n \n \n \n Get the position offset along the ray at t.\n \n The amount to offset.\n The position at t.\n \n \n \n Normalize the lines direction.\n \n \n \n \n Round the rays position and direction.\n \n number of digits to round to.\n \n \n \n A 3D ray struct represented by a position and a direction.\n \n \n \n \n The rays position.\n \n \n \n \n The rays direction.\n Might not be normalized.\n \n \n \n \n Construct a ray from a point and the direction.\n \n The rays position.\n The rays direction (will be normalized)\n \n \n \n Check if the two rays are equal.\n \n The first ray.\n The second ray.\n True if the two rays are equal.\n \n \n \n Check if the two rays are not equal.\n \n The first ray.\n The second ray.\n True if the two rays are not equal.\n \n \n \n Is the ray equal to this object.\n \n The object.\n Is the ray equal to this object.\n \n \n \n Is the ray equal to the other ray.\n \n The over ray.\n Is the ray equal to the other ray.\n \n \n \n The rays hashcode.\n \n The rays hashcode.\n \n \n \n The rays as a string.\n \n \n \n \n \n The rays directions magnidute.\n \n \n \n \n The rays directions square magnidute.\n \n \n \n \n Get the position offset along the ray at t.\n \n The amount to offset.\n The position at t.\n \n \n \n Normalize the lines direction.\n \n \n \n \n Round the rays position and direction.\n \n number of digits to round to.\n \n \n \n A 2D segment.\n \n \n \n \n The segments first point.\n \n \n \n \n The segments second point.\n \n \n \n \n Construct a new segment.\n \n The segments first point.\n The segments second point.\n \n \n \n Construct a new segment.\n \n The segments first points x value.\n The segments first points y value.\n The segments second points x value.\n The segments second points y value.\n \n \n \n The segments center.\n \n \n \n \n The segments length.\n \n \n \n \n The segments square length.\n \n \n \n \n The segments tangent vector.\n \n \n \n \n The segments normal vector.\n \n \n \n \n The left most point of the segment.\n \n \n \n \n The right most point of the segment.\n \n \n \n \n The bottom most point of the segment.\n \n \n \n \n The top most point of the segment.\n \n \n \n \n THe segment flipped, a is now b, b is now a.\n \n \n \n \n The segments bounding box.\n \n \n \n \n Is the segment equal to the other object.\n \n The other object.\n Is the segment equal to the other object.\n \n \n \n Is the segment equal to the other segment.\n \n The other segment.\n Is the segment equal to the other segment.\n \n \n \n The segments hashcode.\n \n The segments hashcode.\n \n \n \n \n \n \n \n \n \n The points distance from the segment.\n \n \n \n \n The points sqr distance from the segment.\n \n \n \n \n Round the segments points.\n \n The number of digits to round to.\n \n \n \n Does the point line on the segemnts.\n \n \n \n \n \n \n \n Return the signed distance to the point. \n Always positive.\n \n \n \n \n Does the two segments intersect.\n \n other segment\n \n \n \n Do the two segments intersect.\n \n other segment\n Intersection point = A + t * (B - A)\n If they intersect\n \n \n \n Do the two segments intersect.\n \n other segment\n Intersection point = A + s * (B - A)\n Intersection point = seg.A + t * (seg.B - seg.A)\n If they intersect\n \n \n \n Does the segment intersect this box.\n \n \n \n \n The closest point on segment to point.\n \n point\n \n \n \n The closest point on segment to point.\n \n point\n closest point = A + t * (B - A)\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n closest point = A + s * (B - A)\n other closest point = seg.A + t * (seg.B - seg.A)\n \n \n \n A 2D segment.\n \n \n \n \n The segments first point.\n \n \n \n \n The segments second point.\n \n \n \n \n Construct a new segment.\n \n The segments first point.\n The segments second point.\n \n \n \n Construct a new segment.\n \n The segments first points x value.\n The segments first points y value.\n The segments second points x value.\n The segments second points y value.\n \n \n \n The segments center.\n \n \n \n \n The segments length.\n \n \n \n \n The segments square length.\n \n \n \n \n The segments tangent vector.\n \n \n \n \n The segments normal vector.\n \n \n \n \n The left most point of the segment.\n \n \n \n \n The right most point of the segment.\n \n \n \n \n The bottom most point of the segment.\n \n \n \n \n The top most point of the segment.\n \n \n \n \n The segment flipped, a is now b, b is now a.\n \n \n \n \n The segments bounding box.\n \n \n \n \n Is the segment equal to the other object.\n \n The other object.\n Is the segment equal to the other object.\n \n \n \n Is the segment equal to the other segment.\n \n The other segment.\n Is the segment equal to the other segment.\n \n \n \n The segments hashcode.\n \n The segments hashcode.\n \n \n \n \n \n \n \n \n \n The points distance from the segment.\n \n \n \n \n The points sqr distance from the segment.\n \n \n \n \n Round the segments points.\n \n The number of digits to round to.\n \n \n \n Does the point line on the segemnts.\n \n \n \n \n \n \n \n Return the signed distance to the point. \n Always positive.\n \n \n \n \n Does the two segments intersect.\n \n other segment\n \n \n \n Do the two segments intersect.\n \n other segment\n Intersection point = A + t * (B - A)\n If they intersect\n \n \n \n Do the two segments intersect.\n \n other segment\n Intersection point = A + s * (B - A)\n Intersection point = seg.A + t * (seg.B - seg.A)\n If they intersect\n \n \n \n Does the segment intersect this box.\n \n \n \n \n The closest point on segment to point.\n \n point\n \n \n \n The closest point on segment to point.\n \n point\n closest point = A + t * (B - A)\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n closest point = A + s * (B - A)\n other closest point = seg.A + t * (seg.B - seg.A)\n \n \n \n A 3D segment.\n \n \n \n \n The segments first (aka source) point.\n \n \n \n \n The segments second (aka target) point.\n \n \n \n \n Create a new segment.\n \n The first point.\n The second point.\n \n \n \n Create a new segment.\n \n The first points x value.\n The first points y value.\n The first points z value.\n The second points x value.\n The second points y value.\n The second points z value.\n \n \n \n The length of the segment.\n \n \n \n \n The square length of the segment.\n \n \n \n \n The segment flipped, a is now b, b is now a.\n \n \n \n \n The bounding box of the segment.\n \n \n \n \n Array acess to the segments points.\n \n The index of the point to access (0-2)\n The point at index i.\n \n \n \n \n Is the segment equal to this object.\n \n The object.\n Is the segment equal to this object.\n \n \n \n Is the segment equal to the other segment.\n \n The other segment.\n Is the segment equal to the other segment.\n \n \n \n The segments hash code.\n \n The segments hash code.\n \n \n \n The segment as a string.\n \n The segment as a string.\n \n \n \n Round the segments points.\n \n number of digits to round to.\n \n \n \n Does the point line on the segemnts.\n \n \n \n \n \n \n \n Return the signed distance to the point. \n Always positive.\n \n \n \n \n The closest point on segment to point.\n \n point\n \n \n \n The closest point on segment to point.\n \n point\n closest point = A + t * (B - A)\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n closest point = A + s * (B - A)\n other closest point = seg.A + t * (seg.B - seg.A)\n \n \n \n A 3D segment.\n \n \n \n \n The segments first (aka source) point.\n \n \n \n \n The segments second (aka target) point.\n \n \n \n \n Create a new segment.\n \n The first point.\n The second point.\n \n \n \n Create a new segment.\n \n The first points x value.\n The first points y value.\n The first points z value.\n The second points x value.\n The second points y value.\n The second points z value.\n \n \n \n The length of the segment.\n \n \n \n \n The square length of the segment.\n \n \n \n \n The segment flipped, a is now b, b is now a.\n \n \n \n \n The bounding box of the segment.\n \n \n \n \n Array acess to the segments points.\n \n The index of the point to access (0-2)\n The point at index i.\n \n \n \n \n Is the segment equal to this object.\n \n The object.\n Is the segment equal to this object.\n \n \n \n Is the segment equal to the other segment.\n \n The other segment.\n Is the segment equal to the other segment.\n \n \n \n The segments hash code.\n \n The segments hash code.\n \n \n \n The segment as a string.\n \n The segment as a string.\n \n \n \n Round the segments points.\n \n number of digits to round to.\n \n \n \n Does the point line on the segemnts.\n \n \n \n \n \n \n \n Return the signed distance to the point. \n Always positive.\n \n \n \n \n The closest point on segment to point.\n \n point\n \n \n \n The closest point on segment to point.\n \n point\n closest point = A + t * (B - A)\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n \n \n \n The closest segment spanning two other segments.\n \n the other segment\n closest point = A + s * (B - A)\n other closest point = seg.A + t * (seg.B - seg.A)\n \n \n \n A segment represented by indices instead of points.\n The indices represent a index into a array of points.\n \n \n \n \n The segments first point index.\n \n \n \n \n The segments seconds point index.\n \n \n \n \n Consturct a new segment.\n \n The segments first point index.\n The segments second point index.\n \n \n \n Does the segment have a null index.\n \n \n \n \n The segment reverse where a is now b and b is now a.\n \n \n \n \n Is the segment equal to this object.\n \n The object.\n Is the segment equal to this object.\n \n \n \n Is the segment equal to the other segment.\n \n The other segment.\n Is the segment equal to the other segment.\n \n \n \n The segments hash code.\n \n The segments hash code.\n \n \n \n The segment as a string.\n \n The segment as a string.\n \n \n \n A 3D sphere.\n \n \n \n \n The shperes center point.\n \n \n \n \n The spheres radius.\n \n \n \n \n Construct a new sphere.\n \n The shperes center point.\n The spheres radius.\n \n \n \n The squared radius.\n \n \n \n \n The spheres diameter.\n \n \n \n \n The spheres area.\n \n \n \n \n The spheres surface area.\n \n \n \n \n Calculate the bounding box.\n \n \n \n \n Is this sphere equal to the other object.\n \n The other object.\n Is this sphere equal to the other object.\n \n \n \n Is this sphere equal to the other sphere.\n \n The other sphere.\n Is this sphere equal to the other sphere.\n \n \n \n The spheres hashcode.\n \n The spheres hashcode.\n \n \n \n \n \n \n \n \n \n Enlarge the sphere so it contains the point p.\n \n \n \n \n Round the spheres components.\n \n The number of digits to round to.\n \n \n \n Find the closest point to the sphere.\n If point inside sphere return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside sphere field is positive.\n If point is inside spher field is negative.\n \n \n \n \n Does the sphere contain the point.\n \n The point\n Does the border count as being in side the sphere.\n true if sphere contains point\n \n \n \n Does the sphere fully contain the box.\n \n The box.\n Does the border count as being in side the sphere.\n oes the sphere fully contain the box.\n \n \n \n Does this sphere intersect with the other sphere.\n \n The other sphere\n Does the border count as being in side the sphere.\n True if the spheres intersect\n \n \n \n Does the sphere intersect the box.\n \n \n Does the border count as being in side the sphere.\n Does the sphere intersect the box.\n \n \n \n Creates a sphere that has both points on its surface.\n \n \n \n \n Creates a sphere that has all 4 points on its surface.\n From MathWorld: http://mathworld.wolfram.com/Circumsphere.html.\n Fails if the points are colinear.\n \n \n \n \n Creates a sphere that contains all three points.\n \n \n \n \n Calculate the minimum bounding sphere that contains \n all the points in the list.\n \n \n \n \n Finds which axis contains the two most extreme points\n \n \n \n \n A 3D sphere.\n \n \n \n \n The shperes center point.\n \n \n \n \n The spheres radius.\n \n \n \n \n Construct a new sphere.\n \n The shperes center point.\n The spheres radius.\n \n \n \n The squared radius.\n \n \n \n \n The spheres diameter.\n \n \n \n \n The spheres area.\n \n \n \n \n The spheres surface area.\n \n \n \n \n Calculate the bounding box.\n \n \n \n \n Is this sphere equal to the other object.\n \n The other object.\n Is this sphere equal to the other object.\n \n \n \n Is this sphere equal to the other sphere.\n \n The other sphere.\n Is this sphere equal to the other sphere.\n \n \n \n The spheres hashcode.\n \n The spheres hashcode.\n \n \n \n \n \n \n \n \n \n Enlarge the sphere so it contains the point p.\n \n \n \n \n Round the spheres components.\n \n The number of digits to round to.\n \n \n \n Find the closest point to the sphere.\n If point inside sphere return point.\n \n \n \n \n Return the signed distance to the point. \n If point is outside sphere field is positive.\n If point is inside spher field is negative.\n \n \n \n \n Does the sphere contain the point.\n \n The point\n Does the border count as being in side the sphere.\n true if sphere contains point\n \n \n \n Does the sphere fully contain the box.\n \n The box.\n Does the border count as being in side the sphere.\n oes the sphere fully contain the box.\n \n \n \n Does this sphere intersect with the other sphere.\n \n The other sphere\n Does the border count as being in side the sphere.\n True if the spheres intersect\n \n \n \n Does the sphere intersect the box.\n \n \n Does the border count as being in side the sphere.\n Does the sphere intersect the box.\n \n \n \n Creates a sphere that has both points on its surface.\n \n \n \n \n Creates a sphere that has all 4 points on its surface.\n From MathWorld: http://mathworld.wolfram.com/Circumsphere.html.\n Fails if the points are colinear.\n \n \n \n \n Creates a sphere that contains all three points.\n \n \n \n \n Calculate the minimum bounding sphere that contains \n all the points in the list.\n \n \n \n \n Finds which axis contains the two most extreme points\n \n \n \n \n A 3D tetrahedron.\n \n \n \n \n The tetrahedrons first point.\n \n \n \n \n The tetrahedrons second point.\n \n \n \n \n The tetrahedrons third point.\n \n \n \n \n The tetrahedrons fourth point.\n \n \n \n \n Create a new tetrahedron.\n \n The first point.\n The second point.\n The third point.\n The fourth point.\n \n \n \n The bounding box of the tetrahedron.\n \n \n \n \n Array acess to the tetrahedrons points.\n \n The index of the point to access (0-3)\n The point at index i.\n \n \n \n \n Is the tetrahedron equal to this object.\n \n The object.\n Is the tetrahedron equal to this object.\n \n \n \n Is the tetrahedron equal to the other tetrahedron.\n \n The other tetrahedron.\n Is the tetrahedron equal to the other tetrahedron.\n \n \n \n The tetrahedrons hash code.\n \n The tetrahedrons hash code.\n \n \n \n The tetrahedron as a string.\n \n The tetrahedron as a string.\n \n \n \n Round the tetrahedrons points.\n \n number of digits to round to.\n \n \n \n A 3D tetrahedron.\n \n \n \n \n The tetrahedrons first point.\n \n \n \n \n The tetrahedrons second point.\n \n \n \n \n The tetrahedrons third point.\n \n \n \n \n The tetrahedrons fourth point.\n \n \n \n \n Create a new tetrahedron.\n \n The first point.\n The second point.\n The third point.\n The fourth point.\n \n \n \n The bounding box of the tetrahedron.\n \n \n \n \n Array acess to the tetrahedrons points.\n \n The index of the point to access (0-3)\n The point at index i.\n \n \n \n \n Is the tetrahedron equal to this object.\n \n The object.\n Is the tetrahedron equal to this object.\n \n \n \n Is the tetrahedron equal to the other tetrahedron.\n \n The other tetrahedron.\n Is the tetrahedron equal to the other tetrahedron.\n \n \n \n The tetrahedrons hash code.\n \n The tetrahedrons hash code.\n \n \n \n The tetrahedron as a string.\n \n The tetrahedron as a string.\n \n \n \n Round the tetrahedrons points.\n \n number of digits to round to.\n \n \n \n A 2D triangle.\n \n \n \n \n The triangles first point.\n \n \n \n \n The triangles second point.\n \n \n \n \n The triangles third point.\n \n \n \n \n Construct a new triangle.\n \n The triangles first point.\n The triangles second point.\n The triangles third point.\n \n \n \n Construct a new triangle.\n \n The triangles first points x value.\n The triangles first points y value.\n The triangles second points x value.\n The triangles second points y value.\n The triangles third points x value.\n The triangles third points y value.\n \n \n \n The average of the triangles positions.\n \n \n \n \n Is the triangle orientated ccw.\n \n \n \n \n The triangles area.\n \n \n \n \n The triangles signed area.\n \n \n \n \n The side lengths are given as\n a = sqrt((cx - bx)^2 + (cy - by)^2) -- side BC opposite of A\n b = sqrt((cx - ax)^2 + (cy - ay)^2) -- side CA opposite of B\n c = sqrt((ax - bx)^2 + (ay - by)^2) -- side AB opposite of C\n \n \n \n \n The side lengths are given as\n ang_a = acos((b^2 + c^2 - a^2) / (2 * b * c)) -- angle at A\n ang_b = acos((c^2 + a^2 - b^2) / (2 * c * a)) -- angle at B\n ang_c = acos((a^2 + b^2 - c^2) / (2 * a * b)) -- angle at C\n \n \n \n \n The semiperimeter is given as\n s = (a + b + c) / 2\n \n \n \n \n The inradius is given as\n r = D / s\n This is the radius of the largest circle that can\n fit within the triangle. Not the same as the \n circum circles radius.\n \n \n \n \n The circumradius is given as\n R = a * b * c / (4 * D)\n \n \n \n \n The circum circle formed by the \n triangles points.\n \n \n \n \n The altitudes are given as\n alt_a = 2 * D / a -- altitude above side a\n alt_b = 2 * D / b -- altitude above side b\n alt_c = 2 * D / c -- altitude above side c\n \n \n \n \n The aspect ratio may be given as the ratio of the longest to the\n shortest edge or, more commonly as the ratio of the circumradius \n to twice the inradius\n ar = R / (2 * r)\n = a * b * c / (8 * (s - a) * (s - b) * (s - c))\n = a * b * c / ((b + c - a) * (c + a - b) * (a + b - c))\n \n \n \n \n Is the triangle equal to the other object.\n \n The other object.\n Is the triangle equal to the other object.\n \n \n \n Is the triangle equal to the other riangle.\n \n The other riangle.\n Is the triangle equal to the other riangle.\n \n \n \n The triangles hashcode.\n \n The triangles hashcode.\n \n \n \n \n \n \n \n \n \n Round the triangles components.\n \n The digits to round to.\n \n \n \n The cross product area which is the \n same as double the signed area.\n \n \n \n \n Return th barycentric coordinates\n with respect to p.\n \n \n \n \n Find the closest point to the triangle.\n If point inside triangle return point.\n \n \n \n \n Returns the signed distance to surface of triangle.\n \n positive if outside triangle, negative if inside and 0 on boundary\n \n \n \n Does triangle contain point.\n \n point\n true if triangle contains point\n \n \n \n Does triangle contain point.\n Asumes triangle is CCW;\n \n point\n true if triangle contains point\n \n \n \n Does the triangle intersect this box.\n \n \n \n \n A 2D triangle.\n \n \n \n \n The triangles first point.\n \n \n \n \n The triangles second point.\n \n \n \n \n The triangles third point.\n \n \n \n \n Construct a new triangle.\n \n The triangles first point.\n The triangles second point.\n The triangles third point.\n \n \n \n Construct a new triangle.\n \n The triangles first points x value.\n The triangles first points y value.\n The triangles second points x value.\n The triangles second points y value.\n The triangles third points x value.\n The triangles third points y value.\n \n \n \n The average of the triangles positions.\n \n \n \n \n Is the triangle orientated ccw.\n \n \n \n \n The triangles area.\n \n \n \n \n The triangles signed area.\n \n \n \n \n The side lengths are given as\n a = sqrt((cx - bx)^2 + (cy - by)^2) -- side BC opposite of A\n b = sqrt((cx - ax)^2 + (cy - ay)^2) -- side CA opposite of B\n c = sqrt((ax - bx)^2 + (ay - by)^2) -- side AB opposite of C\n \n \n \n \n The side lengths are given as\n ang_a = acos((b^2 + c^2 - a^2) / (2 * b * c)) -- angle at A\n ang_b = acos((c^2 + a^2 - b^2) / (2 * c * a)) -- angle at B\n ang_c = acos((a^2 + b^2 - c^2) / (2 * a * b)) -- angle at C\n \n \n \n \n The semiperimeter is given as\n s = (a + b + c) / 2\n \n \n \n \n The inradius is given as\n r = D / s\n This is the radius of the largest circle that can\n fit within the triangle. Not the same as the \n circum circles radius.\n \n \n \n \n The circumradius is given as\n R = a * b * c / (4 * D)\n \n \n \n \n The circum circle formed by the \n triangles points.\n \n \n \n \n The altitudes are given as\n alt_a = 2 * D / a -- altitude above side a\n alt_b = 2 * D / b -- altitude above side b\n alt_c = 2 * D / c -- altitude above side c\n \n \n \n \n The aspect ratio may be given as the ratio of the longest to the\n shortest edge or, more commonly as the ratio of the circumradius \n to twice the inradius\n ar = R / (2 * r)\n = a * b * c / (8 * (s - a) * (s - b) * (s - c))\n = a * b * c / ((b + c - a) * (c + a - b) * (a + b - c))\n \n \n \n \n Is the triangle equal to the other object.\n \n The other object.\n Is the triangle equal to the other object.\n \n \n \n Is the triangle equal to the other riangle.\n \n The other riangle.\n Is the triangle equal to the other riangle.\n \n \n \n The triangles hashcode.\n \n The triangles hashcode.\n \n \n \n \n \n \n \n \n \n Round the triangles components.\n \n The digits to round to.\n \n \n \n The cross product area which is the \n same as double the signed area.\n \n \n \n \n Return th barycentric coordinates\n with respect to p.\n \n \n \n \n Find the closest point to the triangle.\n If point inside triangle return point.\n \n \n \n \n Returns the signed distance to surface of triangle.\n \n positive if outside triangle, negative if inside and 0 on boundary\n \n \n \n Does triangle contain point.\n \n point\n true if triangle contains point\n \n \n \n Does triangle contain point.\n Asumes triangle is CCW;\n \n point\n true if triangle contains point\n \n \n \n Does the triangle intersect this box.\n \n \n \n \n A 3D triangle.\n \n \n \n \n The triangles first point.\n \n \n \n \n The triangles second point.\n \n \n \n \n The triangles third point.\n \n \n \n \n Create a new triangle.\n \n The first point.\n The second point.\n The third point.\n \n \n \n Create a new triangle.\n \n The first points x value.\n The first points y value.\n The first points z value.\n The second points x value.\n The second points y value.\n The second points z value.\n The third points x value.\n The third points y value.\n The third points z value.\n \n \n \n The bounding box of the triangle.\n \n \n \n \n Array acess to the triangles points.\n \n The index of the point to access (0-2)\n The point at index i.\n \n \n \n \n Is the triangle equal to this object.\n \n The object.\n Is the triangle equal to this object.\n \n \n \n Is the triangle equal to the other triangle.\n \n The other triangle.\n Is the triangle equal to the other triangle.\n \n \n \n The triangles hash code.\n \n The triangles hash code.\n \n \n \n The triangle as a string.\n \n The triangle as a string.\n \n \n \n Round the triangles points.\n \n number of digits to round to.\n \n \n \n A 3D triangle.\n \n \n \n \n The triangles first point.\n \n \n \n \n The triangles second point.\n \n \n \n \n The triangles third point.\n \n \n \n \n Create a new triangle.\n \n The first point.\n The second point.\n The third point.\n \n \n \n Create a new triangle.\n \n The first points x value.\n The first points y value.\n The first points z value.\n The second points x value.\n The second points y value.\n The second points z value.\n The third points x value.\n The third points y value.\n The third points z value.\n \n \n \n The bounding box of the triangle.\n \n \n \n \n Array acess to the triangles points.\n \n The index of the point to access (0-2)\n The point at index i.\n \n \n \n \n Is the triangle equal to this object.\n \n The object.\n Is the triangle equal to this object.\n \n \n \n Is the triangle equal to the other triangle.\n \n The other triangle.\n Is the triangle equal to the other triangle.\n \n \n \n The triangles hash code.\n \n The triangles hash code.\n \n \n \n The triangle as a string.\n \n The triangle as a string.\n \n \n \n Round the triangles points.\n \n number of digits to round to.\n \n \n \n A triangle represented by indices instead of points.\n The indices represent a index into a array of points.\n \n \n \n \n The triangles first point index.\n \n \n \n \n The triangles second point index.\n \n \n \n \n The triangles third point index.\n \n \n \n \n Consturct a new triangle.\n \n The triangles first point index.\n The triangles second point index.\n The triangles third point index.\n \n \n \n Does the triangle have a null index.\n \n \n \n \n The triangle reversed.\n \n \n \n \n Is the triangle equal to this object.\n \n The object.\n Is the triangle equal to this object.\n \n \n \n Is the triangle equal to the other triangle.\n \n The other triangle.\n Is the triangle equal to the other triangle.\n \n \n \n The triangles hash code.\n \n The triangles hash code.\n \n \n \n The triangle as a string.\n \n The triangle as a string.\n \n \n\n"
},
{
"path": "CGALDotNet/Arrangements/ArrFace2.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\n\nnamespace CGALDotNet.Arrangements\n{\n public struct ArrFace2\n {\n public bool IsFictitious;\n\n public bool IsUnbounded;\n\n public bool HasOuterEdges;\n\n public int HoleCount;\n\n public int Index;\n\n public int HalfEdgeIndex;\n\n public override string ToString()\n {\n return string.Format(\"[ArrFace2: Index={0}, HalfEdgeIndex={1}, IsFictitious={2}, IsUnbounded={3}, HasOuterEdges={4}, HoleCount={5}]\",\n Index, HalfEdgeIndex, IsFictitious, IsUnbounded, HasOuterEdges, HoleCount);\n }\n\n public IEnumerable EnumerateEdges(Arrangement2 arr)\n {\n int count = arr.HalfEdgeCount;\n\n if (HalfEdgeIndex >= 0 && HalfEdgeIndex < count)\n {\n ArrHalfedge2 edge;\n arr.GetHalfEdge(HalfEdgeIndex, out edge);\n\n foreach (var e in edge.EnumerateEdges(arr))\n yield return e;\n }\n else\n {\n yield break;\n }\n }\n\n public IEnumerable EnumerateVertices(Arrangement2 arr)\n {\n int count = arr.HalfEdgeCount;\n\n if (HalfEdgeIndex >= 0 && HalfEdgeIndex < count)\n {\n ArrHalfedge2 edge;\n arr.GetHalfEdge(HalfEdgeIndex, out edge);\n\n foreach (var e in edge.EnumerateVertices(arr))\n yield return e;\n }\n else\n {\n yield break;\n }\n }\n \n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/ArrHalfEdge2.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n public struct ArrHalfedge2\n {\n public bool IsFictitious;\n\n public int Index;\n\n public int SourceIndex;\n\n public int TargetIndex;\n\n public int FaceIndex;\n\n public int NextIndex;\n\n public int PreviousIndex;\n\n public int TwinIndex;\n\n public override string ToString()\n {\n return string.Format(\"[ArrHalfEdge2: Index={0}, FaceIndex={1}, IsFictitious={2}]\",\n Index, FaceIndex, IsFictitious);\n }\n\n public Segment2d GetSegment(ArrVertex2[] vertices)\n {\n if (SourceIndex == CGALGlobal.NULL_INDEX)\n throw new ArgumentException(\"Source index is null\");\n\n if (TargetIndex == CGALGlobal.NULL_INDEX)\n throw new ArgumentException(\"Target index is null\");\n\n var a = vertices[SourceIndex].Point;\n var b = vertices[TargetIndex].Point;\n \n return new Segment2d(a, b);\n }\n\n public IEnumerable EnumerateEdges(Arrangement2 arr)\n {\n var start = this;\n var e = start;\n\n int count = arr.HalfEdgeCount;\n\n do\n {\n yield return e;\n\n if (e.NextIndex >= 0 && e.NextIndex < count)\n arr.GetHalfEdge(e.NextIndex, out e);\n else\n yield break;\n\n }\n while (e.Index != start.Index);\n }\n\n public IEnumerable EnumerateVertices(Arrangement2 arr)\n {\n var start = this;\n var e = start;\n\n int vertCount = arr.VertexCount;\n int edgeCount = arr.HalfEdgeCount;\n\n do\n {\n if (e.SourceIndex >= 0 && e.SourceIndex < vertCount)\n {\n ArrVertex2 vert;\n arr.GetVertex(e.SourceIndex, out vert);\n yield return vert;\n }\n\n if (e.NextIndex >= 0 && e.NextIndex < edgeCount)\n arr.GetHalfEdge(e.NextIndex, out e);\n else\n yield break;\n }\n while (e.Index != start.Index);\n }\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/ArrQuery.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nnamespace CGALDotNet.Arrangements\n{\n public enum ARR_LOCATOR\n {\n NONE,\n NAIVE,\n WALK,\n LANDMARKS,\n TRAPEZOID\n };\n\n public enum ARR_ELEMENT_HIT\n {\n NONE,\n VERTEX,\n HALF_EDGE,\n FACE\n };\n\n public struct ArrQuery\n {\n public ARR_ELEMENT_HIT Element;\n\n public int Index;\n\n public override string ToString()\n {\n return string.Format(\"[ArrQuery: Element={0}, Index={1}]\", Element, Index);\n }\n }\n \n}\n"
},
{
"path": "CGALDotNet/Arrangements/ArrVertex2.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n\n public struct ArrVertex2\n {\n public Point2d Point;\n\n public int Degree;\n\n public bool IsIsolated;\n\n public int Index;\n\n public int FaceIndex;\n\n public int HalfEdgeIndex;\n\n public override string ToString()\n {\n return string.Format(\"[ArrVertex2: Point={0}, Index={1}, FaceIndex={2}, Degree={3}, IsIsolated={4}]\",\n Point, Index, FaceIndex, Degree, IsIsolated);\n }\n\n public IEnumerable EnumerateHalfedges(Arrangement2 arr)\n {\n ArrHalfedge2 start;\n arr.GetHalfEdge(HalfEdgeIndex, out start);\n ArrHalfedge2 e = start;\n\n int count = arr.HalfEdgeCount;\n\n do\n {\n yield return e;\n\n ArrHalfedge2 twin, next;\n\n if (e.TwinIndex >= 0 && e.TwinIndex < count)\n arr.GetHalfEdge(e.TwinIndex, out twin);\n else\n yield break;\n\n if (e.NextIndex >= 0 && e.NextIndex < count)\n arr.GetHalfEdge(twin.NextIndex, out next);\n else\n yield break;\n\n e = next;\n }\n while (e.Index != start.Index);\n }\n\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/Arrangement2.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\nusing CGALDotNet.Polygons;\nusing CGALDotNet.Triangulations;\nusing CGALDotNet.Meshing;\n\nnamespace CGALDotNet.Arrangements\n{\n\n /// \n /// The generic arrangment class.\n /// \n /// The kernel type.\n public sealed class Arrangement2 : Arrangement2 where K : CGALKernel, new()\n {\n /// \n /// The default constructor.\n /// \n public Arrangement2() : base(new K())\n {\n\n }\n\n /// \n /// Create a arrangement from a unmanaged ptr.\n /// \n /// The unmanaged pointer.\n internal Arrangement2(IntPtr ptr) : base(new K(), ptr)\n {\n\n }\n\n /// \n /// The arrangement as a string.\n /// \n /// \n public override string ToString()\n {\n return string.Format(\"[Arrangement2<{0}>: Vertices={1}, HalfEdges={2}, Faces={3}, Locator={4}]\",\n Kernel.Name, VertexCount, HalfEdgeCount, FaceCount, Locator);\n }\n\n /// \n /// Assigns the contents of another arrangement. \n /// \n /// The other arrangement.\n public void Assign(Arrangement2 other)\n {\n Kernel.Assign(Ptr, other.Ptr);\n }\n\n /// \n /// Computes the overlay of two arrangements and return as a new arrangement.\n /// \n /// The other arrangement.\n /// The overlay of both arrangements.\n public Arrangement2 Overlay(Arrangement2 other)\n {\n var ptr = Kernel.Overlay(Ptr, other.Ptr);\n return new Arrangement2(ptr);\n }\n\n /// \n /// Create a deep copy of this arrangment.\n /// \n /// The deep copy.\n public Arrangement2 Copy()\n {\n var copy = new Arrangement2();\n Kernel.Assign(copy.Ptr, Ptr);\n return copy;\n }\n\n /// \n /// Insert the polygon into this arrangement.\n /// \n /// The polygon.\n /// If the polygon intersects anything else in the arramgement.\n public void InsertPolygon(Polygon2 polygon, bool nonIntersecting)\n {\n Kernel.InsertPolygon(Ptr, polygon.Ptr, nonIntersecting);\n }\n\n /// \n /// Insert the polygon into this arrangement.\n /// \n /// The polygon.\n /// If the polygon intersects anything else in the arramgement.\n public void InsertPolygon(PolygonWithHoles2 polygon, bool nonIntersecting)\n {\n Kernel.InsertPolygon(Ptr, polygon.Ptr, nonIntersecting);\n }\n\n }\n\n /// \n /// The abstract base class.\n /// \n public abstract class Arrangement2 : CGALObject\n {\n /// \n /// The default constructor.\n /// \n private Arrangement2()\n {\n CreateLocator(ARR_LOCATOR.WALK); \n }\n\n /// \n /// Create a arrangement from the kernel.\n /// \n /// The kernel.\n internal Arrangement2(CGALKernel kernel)\n {\n Kernel = kernel.ArrangementKernel2;\n Ptr = Kernel.Create();\n CreateLocator(ARR_LOCATOR.WALK);\n }\n\n /// \n /// Create a arrangement from the kernel and unmanaged pointer.\n /// \n /// The kernel.\n /// The unmanaged pointer.\n internal Arrangement2(CGALKernel kernel, IntPtr ptr) : base(ptr)\n {\n Kernel = kernel.ArrangementKernel2;\n CreateLocator(ARR_LOCATOR.WALK);\n }\n\n /// \n /// The arrangements kernel.\n /// \n protected private ArrangementKernel2 Kernel { get; private set; }\n\n /// \n /// The number of vertices in the arrangement.\n /// \n public int VertexCount => Kernel.VertexCount(Ptr);\n\n /// \n /// The number of vertices in the arrangement that are i\n /// \n public int IsolatedVerticesCount => Kernel.IsolatedVerticesCount(Ptr);\n\n /// \n /// returns the number of arrangement vertices that lie at infinity a\n /// nd are not associated with valid points.\n /// Such vertices are not considered to be regular arrangement \n /// vertices and VertexCount does not count them.\n /// \n public int VerticesAtInfinityCount => Kernel.VerticesAtInfinityCount(Ptr);\n\n /// \n /// The number of half edges.\n /// \n public int HalfEdgeCount => Kernel.HalfEdgeCount(Ptr);\n\n /// \n /// The number of edges. two half edges count as one edge.\n /// \n public int EdgeCount => Kernel.EdgeCount(Ptr);\n\n /// \n /// The number of faces in the arrangement not counting\n /// the unbounded face.\n /// \n public int FaceCount => Kernel.FaceCount(Ptr) - UnboundedFaceCount;\n\n /// \n /// returns the number of unbounded faces in the arrangement.\n /// Such faces are not considered to be regular arrangement \n /// faces and FaceCount does not count them.\n /// \n public int UnboundedFaceCount => Kernel.UnboundedFaceCount(Ptr);\n\n /// \n /// The type of locator used to find element \n /// in the arrangement when queried.\n /// Default is walk which is the best in most cases\n /// \n public ARR_LOCATOR Locator { get; private set; }\n\n /// \n /// Is the arrangement empty.\n /// \n public bool IsEmpty => Kernel.IsEmpty(Ptr);\n\n /// \n /// A number that will change if the unmanaged \n /// arrangement model changes.\n /// \n public int BuildStamp => Kernel.BuildStamp(Ptr);\n\n /// \n /// Clear the arrangement.\n /// \n public void Clear()\n {\n Kernel.Clear(Ptr);\n }\n\n /// \n /// In particular, the functions checks the topological structure of the arrangement \n /// and assures that it is valid. In addition, the function performs several simple \n /// geometric tests to ensure the validity of some of the geometric properties of \n /// the arrangement. Namely, it checks that all arrangement vertices are associated \n /// with distinct points, and that the halfedges around every vertex are ordered clockwise.\n /// \n /// \n public bool IsValid()\n {\n return Kernel.IsValid(Ptr);\n }\n\n /// \n /// Get a copy of all the points in the arrangement.\n /// \n /// A point array that is the length of the vertex count.\n /// The ararys length.\n public void GetPoints(Point2d[] points, int count)\n {\n ErrorUtil.CheckArray(points, count);\n Kernel.GetPoints(Ptr, points, count);\n }\n\n /// \n /// Get a copy of all the segments in the arrangment.\n /// \n /// A segment array that is the length of the edge count.\n /// The ararys length.\n public void GetSegments(Segment2d[] segments, int count)\n {\n ErrorUtil.CheckArray(segments, count);\n Kernel.GetSegments(Ptr, segments, count);\n }\n\n /// \n /// Get a copy of all the vertices in the arrangement.\n /// \n /// A vertices array that is the length of the vertex count.\n /// The ararys length.\n public void GetVertices(ArrVertex2[] vertices, int count)\n {\n ErrorUtil.CheckArray(vertices, count);\n Kernel.GetVertices(Ptr, vertices, count);\n }\n\n /// \n /// Get the vertex from the arrangement.\n /// \n /// The index of the vertex.\n /// The vertex.\n /// True if the vertex was found.\n public bool GetVertex(int index, out ArrVertex2 vertex)\n {\n return Kernel.GetVertex(Ptr, index, out vertex);\n }\n\n /// \n /// Get a copy of all the half edges in the arrangement.\n /// \n /// A half edge array that is the length of the half edge count.\n /// The ararys length.\n public void GetHalfEdges(ArrHalfedge2[] edges, int count)\n {\n ErrorUtil.CheckArray(edges, count);\n Kernel.GetHalfEdges(Ptr, edges, count);\n }\n\n /// \n /// Get the half edge from the arrangement.\n /// \n /// The index of the half edge.\n /// The half edge.\n /// True if the half edge was found.\n public bool GetHalfEdge(int index, out ArrHalfedge2 edge)\n {\n return Kernel.GetHalfEdge(Ptr, index, out edge);\n }\n\n /// \n /// Get a copy of all the faces in the arrangement.\n /// \n /// A face array that is the length of the facee count.\n /// The ararys length.\n public void GetFaces(ArrFace2[] faces, int count)\n {\n ErrorUtil.CheckArray(faces, count);\n Kernel.GetFaces(Ptr, faces, count);\n }\n\n /// \n /// Get the face from the arrangement.\n /// \n /// The index of the half edge.\n /// The face.\n /// True if the face was found.\n public bool GetFace(int index, out ArrFace2 face)\n {\n return Kernel.GetFace(Ptr, index, out face);\n }\n\n /// \n /// Create the locator used to find query the arrangement.\n /// \n /// The locator type.\n public void CreateLocator(ARR_LOCATOR locator)\n {\n if (Locator == locator)\n return;\n\n Locator = locator;\n Kernel.CreateLocator(Ptr, locator);\n }\n\n /// \n /// Release the locator. Default will be used..\n /// Default is walk which is the best in most cases.\n /// \n public void ReleaseLocator()\n {\n if (Locator == ARR_LOCATOR.NONE)\n return;\n\n Locator = ARR_LOCATOR.NONE;\n Kernel.ReleaseLocator(Ptr);\n }\n\n /// \n /// Query what the point hits in the arrangment.\n /// \n /// The point to query.\n /// What was hit.\n /// True if something was hit.\n public bool PointQuery(Point2d point, out ArrQuery result)\n {\n return Kernel.PointQuery(Ptr, point, out result);\n }\n\n /// \n /// Query multiple points in the arrangment.\n /// \n /// The points to query.\n /// The results for each point.\n /// True if any point hit something.\n public bool BatchedPointQuery(Point2d[] points, ArrQuery[] results)\n {\n ErrorUtil.CheckArray(points, points.Length);\n ErrorUtil.CheckArray(results, results.Length);\n\n return Kernel.BatchedPointQuery(Ptr, points, results, points.Length);\n }\n\n /// \n /// Query using a ray going up or down (y axis) from the query point.\n /// \n /// The point to start at.\n /// True to shoot ray up, false to shoot down.\n /// The result of what was hits.\n /// True if some thing was hit.\n public bool VerticalRayQuery(Point2d point, bool up, out ArrQuery result)\n {\n return Kernel.RayQuery(Ptr, point, up, out result);\n }\n\n /// \n /// Locate the vertex at this point.\n /// \n /// The point to locate vertex at.\n /// The vertex.\n /// True if a vertex was located.\n public bool LocateVertex(Point2d point, out ArrVertex2 vert)\n {\n vert = new ArrVertex2();\n if (Kernel.PointQuery(Ptr, point, out ArrQuery result))\n {\n if (result.Element == ARR_ELEMENT_HIT.VERTEX)\n {\n Kernel.GetVertex(Ptr, result.Index, out vert);\n return true;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n }\n\n /// \n /// Locate the closest vertex in the hit face\n /// \n /// The point\n /// The radius te closest vertex has to be within.\n /// The closest vertex.\n /// True if point hit a face and found a vertex.\n public bool LocateVertex(Point2d point, double radius, out ArrVertex2 vertex)\n {\n //Locate the face the point hit.\n vertex = new ArrVertex2();\n if (LocateFace(point, out ArrFace2 face))\n {\n //Find the closest vertex in the face to the point.\n double min = double.PositiveInfinity;\n var closest = new ArrVertex2();\n\n foreach (var vert in face.EnumerateVertices(this))\n {\n if (vert.Index == -1) continue;\n\n var sqdist = Point2d.SqrDistance(vert.Point, point);\n if (sqdist < min)\n {\n min = sqdist;\n closest = vert;\n }\n\n }\n\n if (min == double.PositiveInfinity || min > radius * radius)\n return false;\n else\n {\n vertex = closest;\n return true;\n }\n }\n\n return false;\n }\n\n /// \n /// Locate the edge at this point.\n /// \n /// The point to locate edge at.\n /// The edge.\n /// True if a edge was located.\n public bool LocateEdge(Point2d point, out ArrHalfedge2 edge)\n {\n edge = new ArrHalfedge2();\n if (Kernel.PointQuery(Ptr, point, out ArrQuery result))\n {\n if (result.Element == ARR_ELEMENT_HIT.HALF_EDGE)\n {\n Kernel.GetHalfEdge(Ptr, result.Index, out edge);\n return true;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n }\n\n /// \n /// Locate the closest edge in the hit face.\n /// \n /// The point\n /// The closest edge.\n /// The radius from the point a edge counts as being clicked on.\n /// True if the point hit a face and found a edge.\n public bool LocateEdge(Point2d point, double radius, out ArrHalfedge2 edge)\n {\n //Locate the face the point hit.\n edge = new ArrHalfedge2();\n if (LocateFace(point, out ArrFace2 face))\n {\n //Find the closest edge to the point in the face.\n double min = double.PositiveInfinity;\n var closest = new ArrHalfedge2();\n\n foreach (var e in face.EnumerateEdges(this))\n {\n ArrVertex2 v1, v2;\n if (!GetVertex(e.SourceIndex, out v1)) continue;\n if (!GetVertex(e.TargetIndex, out v2)) continue;\n\n var seg = new Segment2d(v1.Point, v2.Point);\n var sqdist = seg.SqrDistance(point);\n\n if (sqdist < min)\n {\n min = sqdist;\n closest = e;\n }\n\n }\n\n if (min == double.PositiveInfinity || min > radius * radius)\n return false;\n else\n {\n edge = closest;\n return true;\n }\n }\n\n return false;\n }\n\n /// \n /// Locate the faces at this point.\n /// \n /// The point to locate face at.\n /// The face.\n /// True if a face was located.\n public bool LocateFace(Point2d point, out ArrFace2 face)\n {\n face = new ArrFace2();\n if(Kernel.PointQuery(Ptr, point, out ArrQuery result))\n {\n if(result.Element == ARR_ELEMENT_HIT.FACE)\n {\n Kernel.GetFace(Ptr, result.Index, out face);\n return true;\n }\n else\n {\n return false;\n }\n }\n else\n {\n return false;\n }\n }\n\n /// \n /// Find if the arrangement has a element that intersects the segment.\n /// \n /// The segment.\n /// True if the segment intersects something in the arrangement.\n public bool IntersectsSegment(Segment2d segment)\n {\n return Kernel.IntersectsSegment(Ptr, segment);\n }\n\n /// \n /// Inserts a given point into a given arrangement.\n /// It uses a given point-location object to locate the given point in the given arrangement.\n /// If the point conincides with an existing vertex, there is nothing left to do. if it lies \n /// on an edge, the edge is split at the point. Otherwise, the point is contained inside a face, \n /// and is inserted as an isolated vertex inside this face.\n /// \n /// The point to insert.\n public void InsertPoint(Point2d point)\n {\n Kernel.InsertPoint(Ptr, point);\n }\n\n /// \n /// Insert the segment in to the arrangement.\n /// \n /// The segments start point.\n /// The segments end point.\n /// True if the segment is know not to \n /// hit anything currently in the arrangement.\n public void InsertSegment(Point2d a, Point2d b, bool nonIntersecting)\n {\n Kernel.InsertSegment(Ptr, new Segment2d(a, b), nonIntersecting);\n }\n\n /// \n /// Insert a segment into the arrangement.\n /// \n /// \n /// True if the segment is know not to \n /// hit anything currently in the arrangement.\n public void InsertSegment(Segment2d segment, bool nonIntersecting)\n {\n Kernel.InsertSegment(Ptr, segment, nonIntersecting);\n }\n\n /// \n /// Insert a array of segments into the arrangement.\n /// \n /// The segment array\n /// The segment arrays length.\n /// True if the segments are known not to \n /// hit anything currently in the arrangement.\n public void InsertSegments(Segment2d[] segments, int count, bool nonIntersecting)\n {\n ErrorUtil.CheckArray(segments, count);\n Kernel.InsertSegments(Ptr, segments, count, nonIntersecting);\n }\n\n /// \n /// Attempts to removed a given vertex from a given arrangement.\n /// The vertex can be removed if it is either an isolated vertex, \n /// (and has no incident edge,) or if it is a redundant vertex.That is, \n /// it has exactly two incident edges, whose associated curves can be \n /// merged to form a single x-monotone curve.The function returns a \n /// boolean value that indicates whether it succeeded removing the \n /// vertex from the arrangement.\n /// \n /// The index of the vertex in the arrangement.\n /// True if the vertex was removed.\n public bool RemoveVertex(int index)\n {\n return Kernel.RemoveVertexByIndex(Ptr, index);\n }\n\n /// \n /// Attempts to removed a given vertex from a given arrangement.\n /// The vertex can be removed if it is either an isolated vertex, \n /// (and has no incident edge,) or if it is a redundant vertex.That is, \n /// it has exactly two incident edges, whose associated curves can be \n /// merged to form a single x-monotone curve.The function returns a \n /// boolean value that indicates whether it succeeded removing the \n /// vertex from the arrangement.\n /// \n /// The poisition of the vertex in the arrangement.\n /// True if the vertex was removed.\n public bool RemoveVertex(Point2d point)\n {\n return Kernel.RemoveVertexByPoint(Ptr, point);\n }\n\n /// \n /// Removes an edge at the index from the arrangement.\n /// Once the edge is removed, if the vertices associated with its endpoints \n /// become isolated, they are removed as well.\n /// \n /// The index of the one of the half edges in the arrangement.\n /// True if the edge was removed.\n public bool RemoveEdge(int index)\n {\n return Kernel.RemoveEdgeByIndex(Ptr, index);\n }\n\n /// \n /// Removes an edge at the index from the arrangement.\n /// Once the edge is removed, if the vertices associated with its endpoints \n /// become isolated, they are removed as well.\n /// \n /// A segment with the same positions as the edge in the arrangement.\n /// True if the edge was removed.\n public bool RemoveEdge(Segment2d segment)\n {\n return Kernel.RemoveEdgeBySegment(Ptr, segment);\n }\n\n /// \n /// \n /// \n /// \n /// \n public void Print(StringBuilder builder, bool printElements)\n {\n builder.AppendLine(ToString());\n builder.AppendLine(\"Isolated Vertex Count = \" + IsolatedVerticesCount);\n builder.AppendLine(\"Vertex at Infinity Count = \" + VerticesAtInfinityCount);\n builder.AppendLine(\"Edge Count = \" + EdgeCount);\n builder.AppendLine(\"Unbounded Face Count = \" + UnboundedFaceCount);\n\n if (printElements)\n {\n builder.AppendLine();\n\n PrintVertices(builder);\n PrintHalfEdges(builder);\n PrintFaces(builder);\n }\n }\n\n /// \n /// \n /// \n /// \n public override void Print(StringBuilder builder)\n {\n builder.AppendLine(ToString());\n builder.AppendLine(\"Isolated Vertex Count = \" + IsolatedVerticesCount);\n builder.AppendLine(\"Vertex at Infinity Count = \" + VerticesAtInfinityCount);\n builder.AppendLine(\"Edge Count = \" + EdgeCount);\n builder.AppendLine(\"Unbounded Face Count = \" + UnboundedFaceCount);\n }\n\n /// \n /// \n /// \n /// \n public void PrintVertices(StringBuilder builder)\n {\n builder.AppendLine(\"Arrangement Vertices.\\n\");\n\n var vertices = new ArrVertex2[VertexCount];\n GetVertices(vertices, vertices.Length);\n\n foreach (var v in vertices)\n {\n builder.AppendLine(v.ToString());\n builder.AppendLine(\"Index = \" + v.Index);\n builder.AppendLine(\"Face Index = \" + v.FaceIndex);\n builder.AppendLine(\"HalfEdge Index = \" + v.HalfEdgeIndex);\n builder.AppendLine();\n }\n }\n\n /// \n /// \n /// \n /// \n public void PrintHalfEdges(StringBuilder builder)\n {\n builder.AppendLine(\"Arrangement Half Edges.\\n\");\n\n var edges = new ArrHalfedge2[HalfEdgeCount];\n GetHalfEdges(edges, edges.Length);\n\n foreach (var e in edges)\n {\n builder.AppendLine(e.ToString());\n builder.AppendLine(\"Index = \" + e.Index);\n builder.AppendLine(\"Source Index = \" + e.SourceIndex);\n builder.AppendLine(\"Target Index = \" + e.TargetIndex);\n builder.AppendLine(\"Face Index = \" + e.FaceIndex);\n builder.AppendLine(\"Next Index = \" + e.NextIndex);\n builder.AppendLine(\"Previous Index = \" + e.PreviousIndex);\n builder.AppendLine(\"Twin Index = \" + e.TwinIndex);\n builder.AppendLine();\n }\n }\n\n /// \n /// \n /// \n /// \n public void PrintFaces(StringBuilder builder)\n {\n builder.AppendLine(\"Arrangement Faces.\\n\");\n\n var faces = new ArrFace2[FaceCount];\n GetFaces(faces, faces.Length);\n\n foreach (var e in faces)\n {\n builder.AppendLine(e.ToString());\n builder.AppendLine(\"Index = \" + e.Index);\n builder.AppendLine(\"HalfEdge Index = \" + e.HalfEdgeIndex);\n builder.AppendLine();\n }\n }\n\n /// \n /// Release any unmanaged resources.\n /// \n protected override void ReleasePtr()\n {\n Kernel.Release(Ptr);\n }\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/ArrangementKernel2.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n internal abstract class ArrangementKernel2 : CGALObjectKernel\n {\n internal abstract IntPtr Create();\n\n internal abstract void Release(IntPtr ptr);\n\n internal abstract bool IsValid(IntPtr ptr);\n\n internal abstract void Clear(IntPtr ptr);\n\n internal abstract bool IsEmpty(IntPtr ptr);\n\n internal abstract int BuildStamp(IntPtr ptr);\n\n internal abstract void Assign(IntPtr ptr, IntPtr ptrOther);\n\n internal abstract IntPtr Overlay(IntPtr ptr, IntPtr ptrOther);\n\n internal abstract int VertexCount(IntPtr ptr);\n\n internal abstract int IsolatedVerticesCount(IntPtr ptr);\n\n internal abstract int VerticesAtInfinityCount(IntPtr ptr);\n\n internal abstract int HalfEdgeCount(IntPtr ptr);\n\n internal abstract int FaceCount(IntPtr ptr);\n\n internal abstract int EdgeCount(IntPtr ptr);\n\n internal abstract int UnboundedFaceCount(IntPtr ptr);\n\n internal abstract void GetPoints(IntPtr ptr, Point2d[] points, int count);\n \n internal abstract void GetSegments(IntPtr ptr, Segment2d[] segments, int count);\n\n internal abstract void GetVertices(IntPtr ptr, ArrVertex2[] vertices, int count);\n\n internal abstract bool GetVertex(IntPtr ptr, int index, out ArrVertex2 arrVertex);\n\n internal abstract void GetHalfEdges(IntPtr ptr, ArrHalfedge2[] edges, int count);\n\n internal abstract bool GetHalfEdge(IntPtr ptr, int index, out ArrHalfedge2 arrEdge);\n\n internal abstract void GetFaces(IntPtr ptr, ArrFace2[] faces, int count);\n\n internal abstract bool GetFace(IntPtr ptr, int index, out ArrFace2 arrFace);\n\n internal abstract int GetFaceHoleCount(IntPtr ptr, int index);\n\n internal abstract int GetHoleVertexCount(IntPtr ptr, int faceIndex, int holeIndex);\n\n internal abstract void CreateLocator(IntPtr ptr, ARR_LOCATOR type);\n\n internal abstract void ReleaseLocator(IntPtr ptr);\n\n internal abstract bool PointQuery(IntPtr ptr, Point2d point, out ArrQuery result);\n\n internal abstract bool BatchedPointQuery(IntPtr ptr, Point2d[] points, ArrQuery[] results, int count);\n\n internal abstract bool RayQuery(IntPtr ptr, Point2d point, bool up, out ArrQuery result);\n\n internal abstract bool IntersectsSegment(IntPtr ptr, Segment2d segment);\n\n internal abstract void InsertPoint(IntPtr ptr, Point2d point);\n\n internal abstract void InsertPolygon(IntPtr ptr, IntPtr polyPtr, bool nonItersecting);\n\n internal abstract void InsertPolygonWithHoles(IntPtr ptr, IntPtr pwhPtr, bool nonItersecting);\n\n internal abstract void InsertSegment(IntPtr ptr, Segment2d segment, bool nonItersecting);\n\n internal abstract void InsertSegments(IntPtr ptr, Segment2d[] segments, int count, bool nonItersecting);\n\n internal abstract bool RemoveVertexByIndex(IntPtr ptr, int index);\n\n internal abstract bool RemoveVertexByPoint(IntPtr ptr, Point2d point);\n\n internal abstract bool RemoveEdgeByIndex(IntPtr ptr, int index);\n\n internal abstract bool RemoveEdgeBySegment(IntPtr ptr, Segment2d segment);\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/ArrangementKernel2_EEK.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n internal class ArrangementKernel2_EEK : ArrangementKernel2\n {\n internal override string Name => \"EEK\";\n\n internal static readonly ArrangementKernel2 Instance = new ArrangementKernel2_EEK();\n\n internal override IntPtr Create()\n {\n return Arrangement2_EEK_Create();\n }\n\n internal override void Release(IntPtr ptr)\n {\n Arrangement2_EEK_Release(ptr);\n }\n\n internal override bool IsValid(IntPtr ptr)\n {\n return Arrangement2_EEK_IsValid(ptr);\n }\n\n internal override void Clear(IntPtr ptr)\n {\n Arrangement2_EEK_Clear(ptr);\n }\n\n internal override bool IsEmpty(IntPtr ptr)\n {\n return Arrangement2_EEK_IsEmpty(ptr);\n }\n\n internal override int BuildStamp(IntPtr ptr)\n {\n return Arrangement2_EEK_BuildStamp(ptr);\n }\n\n internal override void Assign(IntPtr ptr, IntPtr ptrOther)\n {\n Arrangement2_EEK_Assign(ptr, ptrOther);\n }\n\n internal override IntPtr Overlay(IntPtr ptr, IntPtr ptrOther)\n {\n return Arrangement2_EEK_Overlay(ptr, ptrOther);\n }\n\n internal override int VertexCount(IntPtr ptr)\n {\n return Arrangement2_EEK_VertexCount(ptr);\n }\n\n internal override int IsolatedVerticesCount(IntPtr ptr)\n {\n return Arrangement2_EEK_IsolatedVerticesCount(ptr);\n }\n\n internal override int VerticesAtInfinityCount(IntPtr ptr)\n {\n return Arrangement2_EEK_VerticesAtInfinityCount(ptr);\n }\n\n internal override int HalfEdgeCount(IntPtr ptr)\n {\n return Arrangement2_EEK_HalfEdgeCount(ptr);\n }\n\n internal override int FaceCount(IntPtr ptr)\n {\n return Arrangement2_EEK_FaceCount(ptr);\n }\n\n internal override int EdgeCount(IntPtr ptr)\n {\n return Arrangement2_EEK_EdgeCount(ptr);\n }\n\n internal override int UnboundedFaceCount(IntPtr ptr)\n {\n return Arrangement2_EEK_UnboundedFaceCount(ptr);\n }\n\n internal override void GetPoints(IntPtr ptr, Point2d[] points, int count)\n {\n Arrangement2_EEK_GetPoints(ptr, points, count);\n }\n\n internal override void GetSegments(IntPtr ptr, Segment2d[] segments, int count)\n {\n Arrangement2_EEK_GetSegments(ptr, segments, count);\n }\n\n internal override void GetVertices(IntPtr ptr, ArrVertex2[] vertices, int count)\n {\n Arrangement2_EEK_GetVertices(ptr, vertices, count);\n }\n\n internal override bool GetVertex(IntPtr ptr, int index, out ArrVertex2 arrVertex)\n {\n return Arrangement2_EEK_GetVertex(ptr, index, out arrVertex);\n }\n\n internal override void GetHalfEdges(IntPtr ptr, ArrHalfedge2[] edges, int count)\n {\n Arrangement2_EEK_GetHalfEdges(ptr, edges, count);\n }\n\n internal override bool GetHalfEdge(IntPtr ptr, int index, out ArrHalfedge2 arrEdge)\n {\n return Arrangement2_EEK_GetHalfEdge(ptr, index, out arrEdge);\n }\n\n internal override void GetFaces(IntPtr ptr, ArrFace2[] faces, int count)\n {\n Arrangement2_EEK_GetFaces(ptr, faces, count);\n }\n\n internal override bool GetFace(IntPtr ptr, int index, out ArrFace2 arrFace)\n {\n return Arrangement2_EEK_GetFace(ptr, index, out arrFace);\n }\n\n internal override int GetFaceHoleCount(IntPtr ptr, int index)\n {\n return Arrangement2_EEK_GetFaceHoleCount(ptr, index);\n }\n\n internal override int GetHoleVertexCount(IntPtr ptr, int faceIndex, int holeIndex)\n {\n return Arrangement2_EEK_GetHoleVertexCount(ptr, faceIndex, holeIndex);\n }\n\n internal override void CreateLocator(IntPtr ptr, ARR_LOCATOR type)\n {\n Arrangement2_EEK_CreateLocator(ptr, type);\n }\n\n internal override void ReleaseLocator(IntPtr ptr)\n {\n Arrangement2_EEK_ReleaseLocator(ptr);\n }\n\n internal override bool PointQuery(IntPtr ptr, Point2d point, out ArrQuery result)\n {\n return Arrangement2_EEK_PointQuery(ptr, point, out result);\n }\n\n internal override bool BatchedPointQuery(IntPtr ptr, Point2d[] points, ArrQuery[] results, int count)\n {\n return Arrangement2_EEK_BatchedPointQuery(ptr, points, results, count);\n }\n\n internal override bool RayQuery(IntPtr ptr, Point2d point, bool up, out ArrQuery result)\n {\n return Arrangement2_EEK_RayQuery(ptr, point, up, out result);\n }\n\n internal override bool IntersectsSegment(IntPtr ptr, Segment2d segment)\n {\n return Arrangement2_EEK_IntersectsSegment(ptr, segment);\n }\n\n internal override void InsertPoint(IntPtr ptr, Point2d point)\n {\n Arrangement2_EEK_InsertPoint(ptr, point);\n }\n\n internal override void InsertPolygon(IntPtr ptr, IntPtr polyPtr, bool nonItersecting)\n {\n Arrangement2_EEK_InsertPolygon(ptr, polyPtr, nonItersecting);\n }\n\n internal override void InsertPolygonWithHoles(IntPtr ptr, IntPtr pwhPtr, bool nonItersecting)\n {\n Arrangement2_EEK_InsertPolygonWithHoles(ptr, pwhPtr, nonItersecting);\n }\n\n internal override void InsertSegment(IntPtr ptr, Segment2d segment, bool nonItersecting)\n {\n Arrangement2_EEK_InsertSegment(ptr, segment, nonItersecting);\n }\n\n internal override void InsertSegments(IntPtr ptr, Segment2d[] segments, int count, bool nonItersecting)\n {\n Arrangement2_EEK_InsertSegments(ptr, segments, count, nonItersecting);\n }\n\n internal override bool RemoveVertexByIndex(IntPtr ptr, int index)\n {\n return Arrangement2_EEK_RemoveVertexByIndex(ptr, index);\n }\n\n internal override bool RemoveVertexByPoint(IntPtr ptr, Point2d point)\n {\n return Arrangement2_EEK_RemoveVertexByPoint(ptr, point);\n }\n\n internal override bool RemoveEdgeByIndex(IntPtr ptr, int index)\n {\n return Arrangement2_EEK_RemoveEdgeByIndex(ptr, index);\n }\n\n internal override bool RemoveEdgeBySegment(IntPtr ptr, Segment2d segment)\n {\n return Arrangement2_EEK_RemoveEdgeBySegment(ptr, segment);\n }\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr Arrangement2_EEK_Create();\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_Release(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_IsValid(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_Clear(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_IsEmpty(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_BuildStamp(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_Assign(IntPtr ptr, IntPtr ptrOther);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr Arrangement2_EEK_Overlay(IntPtr ptr, IntPtr ptrOther);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_VertexCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_IsolatedVerticesCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_VerticesAtInfinityCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_HalfEdgeCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_FaceCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_EdgeCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_UnboundedFaceCount(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_GetPoints(IntPtr ptr, [Out] Point2d[] points, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_GetSegments(IntPtr ptr, [Out] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_GetVertices(IntPtr ptr, [Out] ArrVertex2[] vertices, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_GetVertex(IntPtr ptr, int index, [Out] out ArrVertex2 arrVertex);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_GetHalfEdges(IntPtr ptr, [Out] ArrHalfedge2[] edges, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_GetHalfEdge(IntPtr ptr, int index, [Out] out ArrHalfedge2 arrEdge);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_GetFaces(IntPtr ptr, [Out] ArrFace2[] faces, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_GetFace(IntPtr ptr, int index, [Out] out ArrFace2 arrFace);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_GetFaceHoleCount(IntPtr ptr, int index);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int Arrangement2_EEK_GetHoleVertexCount(IntPtr ptr, int faceIndex, int holeIndex);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_CreateLocator(IntPtr ptr, ARR_LOCATOR type);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_ReleaseLocator(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_PointQuery(IntPtr ptr, Point2d point, [Out] out ArrQuery result);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_BatchedPointQuery(IntPtr ptr, [Out] Point2d[] points, [Out] ArrQuery[] results, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_RayQuery(IntPtr ptr, Point2d point, bool up, [Out] out ArrQuery result);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_IntersectsSegment(IntPtr ptr, Segment2d segment);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_InsertPoint(IntPtr ptr, Point2d point);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_InsertPolygon(IntPtr ptr, IntPtr polyPtr, bool nonItersecting);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_InsertPolygonWithHoles(IntPtr ptr, IntPtr pwhPtr, bool nonItersecting);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_InsertSegment(IntPtr ptr, Segment2d segment, bool nonItersecting);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void Arrangement2_EEK_InsertSegments(IntPtr ptr, [In] Segment2d[] points, int count, bool nonItersecting);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_RemoveVertexByIndex(IntPtr ptr, int index);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_RemoveVertexByPoint(IntPtr ptr, Point2d point);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_RemoveEdgeByIndex(IntPtr ptr, int index);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool Arrangement2_EEK_RemoveEdgeBySegment(IntPtr ptr, Segment2d segment);\n\n\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/SweepLine.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n /// \n /// The generic sweep line class.\n /// \n /// The kernel.\n public sealed class SweepLine : SweepLine where K : CGALKernel, new()\n {\n /// \n /// A static instanceof a sweep line.\n /// \n public static readonly SweepLine Instance = new SweepLine();\n\n /// \n /// Default constructor.\n /// \n public SweepLine() : base(new K())\n {\n\n }\n\n /// \n /// Create from a unmanaged pointer.\n /// \n /// \n internal SweepLine(IntPtr ptr) : base(new K(), ptr)\n {\n\n }\n\n /// \n /// The sweep line as a string.\n /// \n /// \n public override string ToString()\n {\n return string.Format(\"[SweepLine<{0}>: ]\", Kernel.Name);\n }\n\n }\n\n /// \n /// The abstract sweep line.\n /// \n public abstract class SweepLine : CGALObject\n {\n /// \n /// The default sweep line.\n /// \n private SweepLine()\n {\n\n }\n\n /// \n /// Create from the kernel.\n /// \n /// A kernel that implements a sweep line.\n internal SweepLine(CGALKernel kernel)\n {\n Kernel = kernel.SweepLineKernel;\n Ptr = Kernel.Create();\n }\n\n /// \n /// Create from the kernel and unmanaged pointer.\n /// \n /// A kernel that implements a sweep line.\n /// A unmanaged pointer to a sweep line.\n internal SweepLine(CGALKernel kernel, IntPtr ptr) : base(ptr)\n {\n Kernel = kernel.SweepLineKernel;\n }\n\n /// \n /// The sweep line kernel.\n /// \n protected private SweepLineKernel Kernel { get; private set; }\n\n /// \n /// Do any of the segments in the array intersect.\n /// \n /// The segment array.\n /// The ararys length.\n /// Do any of the segments in the array intersect.\n public bool DoIntersect(Segment2d[] segments, int count)\n {\n ErrorUtil.CheckArray(segments, count);\n return Kernel.DoIntersect(Ptr, segments, count);\n }\n\n /// \n /// Compute all the sub segemnts from the intersection \n /// of the segments in the array.\n /// \n /// The segment array.\n /// The ararys length.\n /// The sub segments.\n public Segment2d[] ComputeSubcurves(Segment2d[] segments, int count)\n {\n ErrorUtil.CheckArray(segments, count);\n\n int len = Kernel.ComputeSubcurves(Ptr, segments, count);\n var subSegments = new Segment2d[len];\n\n if (len > 0)\n {\n GetSegments(subSegments, len);\n ClearSegmentBuffer();\n }\n\n return subSegments;\n }\n\n /// \n /// Compute all the intersection points from the \n /// segments in the array.\n /// \n /// The segment array.\n /// The ararys length.\n /// The intersection points.\n public Point2d[] ComputeIntersectionPoints(Segment2d[] segments, int count)\n {\n ErrorUtil.CheckArray(segments, count);\n\n int len = Kernel.ComputeIntersectionPoints(Ptr, segments, count);\n var points = new Point2d[len];\n\n if (len > 0)\n {\n GetPoints(points, len);\n ClearPointBuffer();\n }\n\n return points;\n }\n\n /// \n /// Get all the points in the point buffer.\n /// \n /// A point array the size of the point buffer.\n /// The ararys length.\n private void GetPoints(Point2d[] points, int count)\n {\n ErrorUtil.CheckArray(points, count);\n Kernel.GetPoints(Ptr, points, count);\n }\n\n /// \n /// Get all the segments in the point buffer.\n /// \n /// A segment array the size of the segment buffer.\n /// The ararys length.\n private void GetSegments(Segment2d[] segments, int count)\n {\n ErrorUtil.CheckArray(segments, count);\n Kernel.GetSegments(Ptr, segments, count);\n }\n\n /// \n /// Clear the point buffer.\n /// \n private void ClearPointBuffer()\n {\n Kernel.ClearPointBuffer(Ptr);\n }\n\n /// \n /// Clear the segment buffer.\n /// \n private void ClearSegmentBuffer()\n {\n Kernel.ClearSegmentBuffer(Ptr);\n }\n\n /// \n /// \n /// \n /// \n private int PointBufferSize()\n {\n return Kernel.PointBufferSize(Ptr);\n }\n\n /// \n /// \n /// \n /// \n private int SegmentBufferSize()\n {\n return Kernel.SegmentBufferSize(Ptr);\n }\n\n /// \n /// Release any unmanaged resources.\n /// \n protected override void ReleasePtr()\n {\n Kernel.Release(Ptr);\n }\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/SweepLineKernel.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n internal abstract class SweepLineKernel : CGALObjectKernel\n {\n internal abstract IntPtr Create();\n\n internal abstract void Release(IntPtr ptr);\n\n\t\tinternal abstract void ClearPointBuffer(IntPtr ptr);\n\n\t\tinternal abstract void ClearSegmentBuffer(IntPtr ptr);\n\n\t\tinternal abstract int PointBufferSize(IntPtr ptr);\n\n\t\tinternal abstract int SegmentBufferSize(IntPtr ptr);\n\n\t\tinternal abstract bool DoIntersect(IntPtr ptr, Segment2d[] segments, int count);\n\n\t\tinternal abstract int ComputeSubcurves(IntPtr ptr, Segment2d[] segments, int count);\n\n\t\tinternal abstract int ComputeIntersectionPoints(IntPtr ptr, Segment2d[] segments, int count);\n\n\t\tinternal abstract void GetPoints(IntPtr ptr, Point2d[] points, int count);\n\n\t\tinternal abstract void GetSegments(IntPtr ptr, Segment2d[] segments, int count);\n\t}\n}\n"
},
{
"path": "CGALDotNet/Arrangements/SweepLineKernel_EEK.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n internal class SweepLineKernel_EEK : SweepLineKernel\n {\n internal override string Name => \"EEK\";\n\n internal static readonly SweepLineKernel Instance = new SweepLineKernel_EEK();\n\n internal override IntPtr Create()\n {\n return SweepLine2_EEK_Create();\n }\n\n internal override void Release(IntPtr ptr)\n {\n SweepLine2_EEK_Release(ptr);\n }\n\n internal override void ClearPointBuffer(IntPtr ptr)\n {\n SweepLine2_EEK_ClearPointBuffer(ptr);\n }\n\n internal override void ClearSegmentBuffer(IntPtr ptr)\n {\n SweepLine2_EEK_ClearSegmentBuffer(ptr);\n }\n\n internal override int PointBufferSize(IntPtr ptr)\n {\n return SweepLine2_EEK_PointBufferSize(ptr);\n }\n\n internal override int SegmentBufferSize(IntPtr ptr)\n {\n return SweepLine2_EEK_SegmentBufferSize(ptr);\n }\n\n internal override bool DoIntersect(IntPtr ptr, Segment2d[] segments, int count)\n {\n return SweepLine2_EEK_DoIntersect(ptr, segments, count);\n }\n\n internal override int ComputeSubcurves(IntPtr ptr, Segment2d[] segments, int count)\n {\n return SweepLine2_EEK_ComputeSubcurves(ptr, segments, count);\n }\n\n internal override int ComputeIntersectionPoints(IntPtr ptr, Segment2d[] segments, int count)\n {\n return SweepLine2_EEK_ComputeIntersectionPoints(ptr, segments, count);\n }\n\n internal override void GetPoints(IntPtr ptr, Point2d[] points, int count)\n {\n SweepLine2_EEK_GetPoints(ptr, points, count);\n }\n\n internal override void GetSegments(IntPtr ptr, Segment2d[] segments, int count)\n {\n SweepLine2_EEK_GetSegments(ptr, segments, count);\n }\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr SweepLine2_EEK_Create();\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EEK_Release(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EEK_ClearPointBuffer(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EEK_ClearSegmentBuffer(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EEK_PointBufferSize(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EEK_SegmentBufferSize(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool SweepLine2_EEK_DoIntersect(IntPtr ptr, [In] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EEK_ComputeSubcurves(IntPtr ptr, [In] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EEK_ComputeIntersectionPoints(IntPtr ptr, [In] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EEK_GetPoints(IntPtr ptr, [Out] Point2d[] points, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EEK_GetSegments(IntPtr ptr, [Out] Segment2d[] segments, int count);\n }\n}\n"
},
{
"path": "CGALDotNet/Arrangements/SweepLineKernel_EIK.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Arrangements\n{\n internal class SweepLineKernel_EIK : SweepLineKernel\n {\n internal override string Name => \"EIK\";\n\n internal static readonly SweepLineKernel Instance = new SweepLineKernel_EIK();\n\n internal override IntPtr Create()\n {\n return SweepLine2_EIK_Create();\n }\n\n internal override void Release(IntPtr ptr)\n {\n SweepLine2_EIK_Release(ptr);\n }\n\n internal override void ClearPointBuffer(IntPtr ptr)\n {\n SweepLine2_EIK_ClearPointBuffer(ptr);\n }\n\n internal override void ClearSegmentBuffer(IntPtr ptr)\n {\n SweepLine2_EIK_ClearSegmentBuffer(ptr);\n }\n\n internal override int PointBufferSize(IntPtr ptr)\n {\n return SweepLine2_EIK_PointBufferSize(ptr);\n }\n\n internal override int SegmentBufferSize(IntPtr ptr)\n {\n return SweepLine2_EIK_SegmentBufferSize(ptr);\n }\n\n internal override bool DoIntersect(IntPtr ptr, Segment2d[] segments, int count)\n {\n return SweepLine2_EIK_DoIntersect(ptr, segments, count);\n }\n\n internal override int ComputeSubcurves(IntPtr ptr, Segment2d[] segments, int count)\n {\n return SweepLine2_EIK_ComputeSubcurves(ptr, segments, count);\n }\n\n internal override int ComputeIntersectionPoints(IntPtr ptr, Segment2d[] segments, int count)\n {\n return SweepLine2_EIK_ComputeIntersectionPoints(ptr, segments, count);\n }\n\n internal override void GetPoints(IntPtr ptr, Point2d[] points, int count)\n {\n SweepLine2_EIK_GetPoints(ptr, points, count);\n }\n\n internal override void GetSegments(IntPtr ptr, Segment2d[] segments, int count)\n {\n SweepLine2_EIK_GetSegments(ptr, segments, count);\n }\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr SweepLine2_EIK_Create();\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EIK_Release(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EIK_ClearPointBuffer(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EIK_ClearSegmentBuffer(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EIK_PointBufferSize(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EIK_SegmentBufferSize(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool SweepLine2_EIK_DoIntersect(IntPtr ptr, [In] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EIK_ComputeSubcurves(IntPtr ptr, [In] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int SweepLine2_EIK_ComputeIntersectionPoints(IntPtr ptr, [In] Segment2d[] segments, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EIK_GetPoints(IntPtr ptr, [Out] Point2d[] points, int count);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void SweepLine2_EIK_GetSegments(IntPtr ptr, [Out] Segment2d[] segments, int count);\n }\n}\n"
},
{
"path": "CGALDotNet/CGALDotNet.csproj",
"content": "\n\n \n netcoreapp3.1\n OnBuildSuccess\n True\n F:\\Projects\\Visual Studio Projects\\CGALDotNet\\CGALDotNet\\CGALDotNet.xml\n \n\n \n true\n \n\n \n true\n AnyCPU\n F:\\Projects\\Visual Studio Projects\\CGALDotNet\\CGALDotNet\\CGALDotNet.xml\n \n\n \n \n \n\n \n \n \n\n \n \n \n\n \n \n ..\\..\\CGALDotNetGeometry\\CGALDotNetGeometry\\bin\\Release\\netcoreapp3.1\\CGALDotNetGeometry.dll\n \n \n\n\n"
},
{
"path": "CGALDotNet/CGALDotNet.xml",
"content": "\n\n \n CGALDotNet\n \n \n \n \n The generic arrangment class.\n \n The kernel type.\n \n \n \n The default constructor.\n \n \n \n \n Create a arrangement from a unmanaged ptr.\n \n The unmanaged pointer.\n \n \n \n The arrangement as a string.\n \n \n \n \n \n Assigns the contents of another arrangement. \n \n The other arrangement.\n \n \n \n Computes the overlay of two arrangements and return as a new arrangement.\n \n The other arrangement.\n The overlay of both arrangements.\n \n \n \n Create a deep copy of this arrangment.\n \n The deep copy.\n \n \n \n Insert the polygon into this arrangement.\n \n The polygon.\n If the polygon intersects anything else in the arramgement.\n \n \n \n Insert the polygon into this arrangement.\n \n The polygon.\n If the polygon intersects anything else in the arramgement.\n \n \n \n The abstract base class.\n \n \n \n \n The default constructor.\n \n \n \n \n Create a arrangement from the kernel.\n \n The kernel.\n \n \n \n Create a arrangement from the kernel and unmanaged pointer.\n \n The kernel.\n The unmanaged pointer.\n \n \n \n The arrangements kernel.\n \n \n \n \n The number of vertices in the arrangement.\n \n \n \n \n The number of vertices in the arrangement that are i\n \n \n \n \n returns the number of arrangement vertices that lie at infinity a\n nd are not associated with valid points.\n Such vertices are not considered to be regular arrangement \n vertices and VertexCount does not count them.\n \n \n \n \n The number of half edges.\n \n \n \n \n The number of edges. two half edges count as one edge.\n \n \n \n \n The number of faces in the arrangement not counting\n the unbounded face.\n \n \n \n \n returns the number of unbounded faces in the arrangement.\n Such faces are not considered to be regular arrangement \n faces and FaceCount does not count them.\n \n \n \n \n The type of locator used to find element \n in the arrangement when queried.\n Default is walk which is the best in most cases\n \n \n \n \n Is the arrangement empty.\n \n \n \n \n A number that will change if the unmanaged \n arrangement model changes.\n \n \n \n \n Clear the arrangement.\n \n \n \n \n In particular, the functions checks the topological structure of the arrangement \n and assures that it is valid. In addition, the function performs several simple \n geometric tests to ensure the validity of some of the geometric properties of \n the arrangement. Namely, it checks that all arrangement vertices are associated \n with distinct points, and that the halfedges around every vertex are ordered clockwise.\n \n \n \n \n \n Get a copy of all the points in the arrangement.\n \n A point array that is the length of the vertex count.\n The ararys length.\n \n \n \n Get a copy of all the segments in the arrangment.\n \n A segment array that is the length of the edge count.\n The ararys length.\n \n \n \n Get a copy of all the vertices in the arrangement.\n \n A vertices array that is the length of the vertex count.\n The ararys length.\n \n \n \n Get the vertex from the arrangement.\n \n The index of the vertex.\n The vertex.\n True if the vertex was found.\n \n \n \n Get a copy of all the half edges in the arrangement.\n \n A half edge array that is the length of the half edge count.\n The ararys length.\n \n \n \n Get the half edge from the arrangement.\n \n The index of the half edge.\n The half edge.\n True if the half edge was found.\n \n \n \n Get a copy of all the faces in the arrangement.\n \n A face array that is the length of the facee count.\n The ararys length.\n \n \n \n Get the face from the arrangement.\n \n The index of the half edge.\n The face.\n True if the face was found.\n \n \n \n Create the locator used to find query the arrangement.\n \n The locator type.\n \n \n \n Release the locator. Default will be used..\n Default is walk which is the best in most cases.\n \n \n \n \n Query what the point hits in the arrangment.\n \n The point to query.\n What was hit.\n True if something was hit.\n \n \n \n Query multiple points in the arrangment.\n \n The points to query.\n The results for each point.\n True if any point hit something.\n \n \n \n Query using a ray going up or down (y axis) from the query point.\n \n The point to start at.\n True to shoot ray up, false to shoot down.\n The result of what was hits.\n True if some thing was hit.\n \n \n \n Locate the vertex at this point.\n \n The point to locate vertex at.\n The vertex.\n True if a vertex was located.\n \n \n \n Locate the closest vertex in the hit face\n \n The point\n The radius te closest vertex has to be within.\n The closest vertex.\n True if point hit a face and found a vertex.\n \n \n \n Locate the edge at this point.\n \n The point to locate edge at.\n The edge.\n True if a edge was located.\n \n \n \n Locate the closest edge in the hit face.\n \n The point\n The closest edge.\n The radius from the point a edge counts as being clicked on.\n True if the point hit a face and found a edge.\n \n \n \n Locate the faces at this point.\n \n The point to locate face at.\n The face.\n True if a face was located.\n \n \n \n Find if the arrangement has a element that intersects the segment.\n \n The segment.\n True if the segment intersects something in the arrangement.\n \n \n \n Inserts a given point into a given arrangement.\n It uses a given point-location object to locate the given point in the given arrangement.\n If the point conincides with an existing vertex, there is nothing left to do. if it lies \n on an edge, the edge is split at the point. Otherwise, the point is contained inside a face, \n and is inserted as an isolated vertex inside this face.\n \n The point to insert.\n \n \n \n Insert the segment in to the arrangement.\n \n The segments start point.\n The segments end point.\n True if the segment is know not to \n hit anything currently in the arrangement.\n \n \n \n Insert a segment into the arrangement.\n \n \n True if the segment is know not to \n hit anything currently in the arrangement.\n \n \n \n Insert a array of segments into the arrangement.\n \n The segment array\n The segment arrays length.\n True if the segments are known not to \n hit anything currently in the arrangement.\n \n \n \n Attempts to removed a given vertex from a given arrangement.\n The vertex can be removed if it is either an isolated vertex, \n (and has no incident edge,) or if it is a redundant vertex.That is, \n it has exactly two incident edges, whose associated curves can be \n merged to form a single x-monotone curve.The function returns a \n boolean value that indicates whether it succeeded removing the \n vertex from the arrangement.\n \n The index of the vertex in the arrangement.\n True if the vertex was removed.\n \n \n \n Attempts to removed a given vertex from a given arrangement.\n The vertex can be removed if it is either an isolated vertex, \n (and has no incident edge,) or if it is a redundant vertex.That is, \n it has exactly two incident edges, whose associated curves can be \n merged to form a single x-monotone curve.The function returns a \n boolean value that indicates whether it succeeded removing the \n vertex from the arrangement.\n \n The poisition of the vertex in the arrangement.\n True if the vertex was removed.\n \n \n \n Removes an edge at the index from the arrangement.\n Once the edge is removed, if the vertices associated with its endpoints \n become isolated, they are removed as well.\n \n The index of the one of the half edges in the arrangement.\n True if the edge was removed.\n \n \n \n Removes an edge at the index from the arrangement.\n Once the edge is removed, if the vertices associated with its endpoints \n become isolated, they are removed as well.\n \n A segment with the same positions as the edge in the arrangement.\n True if the edge was removed.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n The generic sweep line class.\n \n The kernel.\n \n \n \n A static instanceof a sweep line.\n \n \n \n \n Default constructor.\n \n \n \n \n Create from a unmanaged pointer.\n \n \n \n \n \n The sweep line as a string.\n \n \n \n \n \n The abstract sweep line.\n \n \n \n \n The default sweep line.\n \n \n \n \n Create from the kernel.\n \n A kernel that implements a sweep line.\n \n \n \n Create from the kernel and unmanaged pointer.\n \n A kernel that implements a sweep line.\n A unmanaged pointer to a sweep line.\n \n \n \n The sweep line kernel.\n \n \n \n \n Do any of the segments in the array intersect.\n \n The segment array.\n The ararys length.\n Do any of the segments in the array intersect.\n \n \n \n Compute all the sub segemnts from the intersection \n of the segments in the array.\n \n The segment array.\n The ararys length.\n The sub segments.\n \n \n \n Compute all the intersection points from the \n segments in the array.\n \n The segment array.\n The ararys length.\n The intersection points.\n \n \n \n Get all the points in the point buffer.\n \n A point array the size of the point buffer.\n The ararys length.\n \n \n \n Get all the segments in the point buffer.\n \n A segment array the size of the segment buffer.\n The ararys length.\n \n \n \n Clear the point buffer.\n \n \n \n \n Clear the segment buffer.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Global utility functions.\n \n \n \n \n Get the version of CGAL in use.\n \n \n \n \n Get the version of eigen being used.\n \n \n \n \n Returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n Returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n Returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n returns OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n The first vector.\n The second vector.\n OBTUSE, RIGHT or ACUTE depending on the \n angle formed by the two vectors u and v.\n \n \n \n Returns an approximation of the angle between u and v.\n \n The first vector.\n The second vector.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the angle between p-q and r-q.\n \n The first tetrahedrons point.\n The second tetrahedrons point.\n The third tetrahedrons point.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the angle between u and v.\n \n The first vector.\n The second vector.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the angle between p-q and r-q.\n \n The first tetrahedrons point.\n The second tetrahedrons point.\n The third tetrahedrons point.\n The angle is given in degrees.\n \n \n \n Returns an approximation of the signed dihedral angle \n in the tetrahedron pqrs of edge pq.\n p,q,r and p,q,s are not collinear.\n \n The first tetrahedrons point.\n The second tetrahedrons point.\n The third tetrahedrons point.\n The fourth tetrahedrons point.\n The sign is negative if orientation(p,q,r,s) \n is CGAL::NEGATIVE and positive otherwise.\n The angle is given in degrees.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n Returns true, if the three points are collinear \n and q lies between p and r.\n Note that true is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n Returns true, if the three points are \n collinear and q lies between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n returns true, if the three points are collinear \n and q lies strictly between p and r.\n Note that false is returned, if q==p or q==r.\n \n The first point.\n The second point.\n The third point.\n returns true, iff the three points are \n collinear and q lies strictly between p and r.\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n returns true, if p, q, and r are collinear\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n returns true, if p, q, and r are collinear\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n returns true, if p, q, and r are collinear\n \n \n \n Returns true, if p, q, and r are collinear\n \n The first point.\n The second point.\n The third point.\n Returns true, iff p, q, and r are collinear\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Compute the barycenter of the points p1, p2 and p3 \n with corresponding weights w1, w2 and w3 as 1.\n \n The first point.\n The second point.\n The third point.\n Compute the barycenter of the points.\n \n \n \n Constructs the bisector line of the two points p and q.\n The bisector is oriented in such a way that p lies on its positive side.\n \n The first point.\n The second point.\n Constructs the bisector line of the two points p and q.\n \n \n \n Constructs the bisector of the two lines l1 and l2.\n \n In the general case, the bisector has the direction of\n the vector which is the sum of the normalized directions \n of the two lines, and which passes through the intersection \n of l1 and l2. If l1 and l2 are parallel, then the bisector \n is defined as the line which has the same direction as l1, \n and which is at the same distance from l1 and l2. \n If Kernel::FT is not a model of FieldWithSqrt an \n approximation of the square root will be used in this \n function, impacting the exactness of the result even \n with an (exact) multiprecision number type.\n \n The first line.\n The second line.\n Constructs the bisector of the two lines l1 and l2.\n \n \n \n Constructs the bisector of the two lines l1 and l2.\n \n In the general case, the bisector has the direction of\n the vector which is the sum of the normalized directions \n of the two lines, and which passes through the intersection \n of l1 and l2. If l1 and l2 are parallel, then the bisector \n is defined as the line which has the same direction as l1, \n and which is at the same distance from l1 and l2. \n If Kernel::FT is not a model of FieldWithSqrt an \n approximation of the square root will be used in this \n function, impacting the exactness of the result even \n with an (exact) multiprecision number type.\n \n The first line.\n The second line.\n Constructs the bisector of the two lines l1 and l2.\n \n \n \n Constructs the bisector of the two lines l1 and l2.\n \n In the general case, the bisector has the direction of\n the vector which is the sum of the normalized directions \n of the two lines, and which passes through the intersection \n of l1 and l2. If l1 and l2 are parallel, then the bisector \n is defined as the line which has the same direction as l1, \n and which is at the same distance from l1 and l2. \n If Kernel::FT is not a model of FieldWithSqrt an \n approximation of the square root will be used in this \n function, impacting the exactness of the result even \n with an (exact) multiprecision number type.\n \n The first line.\n The second line.\n Constructs the bisector of the two lines l1 and l2.\n \n \n \n Returns true, if p, q, r, and s are coplanar.\n \n The first point.\n The second point.\n The third point.\n The fourth point\n Returns true, if p, q, r, and s are coplanar.\n \n \n \n If p,q,r are collinear, then CGAL_COLLINEAR is returned.\n If not, then p,q,r define a plane p. The return value in this \n case is either CGAL_POSITIVE or CGAL_NEGATIVE, but we don't \n specify it explicitly. However, we guarantee that all calls to\n this predicate over 3 points in p will return a coherent \n orientation if considered a 2D orientation in p\n \n The first point.\n The second point.\n The third point.\n If p,q,r are collinear, then CGAL_COLLINEAR is returned.\n \n \n \n Let P be the plane defined by the points p, q, and r.\n Note that the order defines the orientation of P. The function computes \n the orientation of points p, q, and s in P: If p, q, s are collinear, \n CGAL_COLLINEAR is returned. If P and the plane defined by p, q,\n and s have the same orientation, CGAL_POSITIVE is returned; \n otherwise CGAL_NEGATIVE is returned.\n p, q, r, and s are coplanar and p, q, and r are not collinear.\n \n The first point.\n The second point.\n The third point.\n The fourth point\n \n \n \n \n Constructs the line which is at the same distance from the three points p, q and r.\n p, q and r are not collinear.\n \n \n \n \n Constructs the line which is at the same distance from the three points p, q and r.\n \n \n \n Returns true if p, q, and r form a left turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a left turn.\n \n \n \n Returns true if p, q, and r form a left turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a left turn.\n \n \n \n Returns true if p, q, and r form a left turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a left turn.\n \n \n \n Returns true if p, q, and r form a right turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a right turn.\n \n \n \n Returns true if p, q, and r form a right turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a right turn.\n \n \n \n Returns true if p, q, and r form a right turn.\n \n The first point.\n The second point.\n The third point.\n Returns true if p, q, and r form a right turn.\n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n The third point.\n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n The third point.\n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n The third point.\n \n \n \n \n returns LEFT_TURN if u and v form a left turn, returns \n RIGHT_TURN if u and v form a right turn, and returns \n COLLINEAR if u and v are collinear.\n \n \n \n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n \n \n \n \n Returns LEFT_TURN, if r lies to the left of the oriented \n line l defined by p and q, returns RIGHT_TURN if r lies \n to the right of l, and returns COLLINEAR if r lies on l.\n \n The first point.\n The second point.\n \n \n \n \n returns POSITIVE, if s lies on the positive side of the \n oriented plane h defined by p, q, and r, returns NEGATIVE\n if s lies on the negative side of h, and returns COPLANAR \n if s lies on h.\n \n The first point.\n The second point.\n The third point.\n The fourth point\n \n \n \n \n returns NEGATIVE if u, v and w are negatively oriented, \n POSITIVE if u, v and w are positively oriented,\n and COPLANAR if u, v and w are coplanar.\n \n \n \n \n \n \n \n \n computes an orthogonal vector of the plane defined by p, q\n and r, which is directed to the positive side of this plane.\n \n The first point.\n The second point.\n The third point.\n computes an orthogonal vector of the plane\n \n \n \n returns true, if l1 and l2 are parallel or if one of those \n (or both) is degenerate.\n \n The first line.\n The seconed line.\n returns true, if l1 and l2 are parallel\n \n \n \n returns true, if l1 and l2 are parallel or if one of those \n (or both) is degenerate.\n \n The first line.\n The seconed line.\n returns true, if l1 and l2 are parallel\n \n \n \n returns true, if l1 and l2 are parallel or if one of those \n (or both) is degenerate.\n \n The first line.\n The seconed line.\n returns true, if l1 and l2 are parallel\n \n \n \n returns true, if r1 and r2 are parallel or if one of \n those (or both) is degenerate.\n \n The first ray.\n The second ray.\n returns true, if r1 and r2 are parallel\n \n \n \n returns true, if r1 and r2 are parallel or if one of \n those (or both) is degenerate.\n \n The first ray.\n The second ray.\n returns true, if r1 and r2 are parallel\n \n \n \n returns true, if r1 and r2 are parallel or if one of \n those (or both) is degenerate.\n \n The first ray.\n The second ray.\n returns true, if r1 and r2 are parallel\n \n \n \n returns true, if s1 and s2 are parallel or if one of \n those (or both) is degenerate.\n \n The first segment.\n The secong segment.\n returns true, if s1 and s2 are parallel\n \n \n \n returns true, if s1 and s2 are parallel or if one of \n those (or both) is degenerate.\n \n The first segment.\n The secong segment.\n returns true, if s1 and s2 are parallel\n \n \n \n returns true, if s1 and s2 are parallel or if one of \n those (or both) is degenerate.\n \n The first segment.\n The secong segment.\n returns true, if s1 and s2 are parallel\n \n \n \n Base class for objects that referrence a CGAL object.\n \n \n \n \n The pointer to the unmanged CGAL object.\n \n \n \n \n Default constructor.\n \n \n \n \n Constructor taking a referrence to a CGAL object.\n \n A pointer to a CGAL object.\n \n \n \n The destuctor.\n \n \n \n \n Has the object been disposed.\n \n \n \n \n Get the ptr to the CGAL object.\n \n \n \n \n Dispose the CGAL object.\n \n \n \n \n Print some information about the object.\n \n Print some information about the object.\n \n \n \n Print the object into the console.\n \n \n \n \n Print the object into a string builder.\n \n The builder to print into.\n \n \n \n Release the CGAL object.\n \n \n \n \n Swap the unmanaged pointer with another.\n The old ptr will be released first.\n \n The new ptr. The old ptr will be released first.\n \n \n \n Allow derived class to release the unmanaged memory.\n \n \n \n \n Allow derived class to release the unmanaged memory.\n \n \n \n \n Check if the object is still valid.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n enum for egien solvers.\n \n \n \n \n Create a new matrix filled with zeros.\n \n The number of rows.\n The number of columns.\n \n \n \n Create a new matrix fill with the array contents.\n \n The array.\n \n \n \n Create a new matrix filled with the contents of the column vectors.\n All column vectors must have the same dimension.\n \n \n \n \n \n Create a 2 x 2 matrix.\n \n \n \n \n Create a 3 x 3 matrix.\n \n \n \n \n Create a 4 x 4 matrix.\n \n \n \n \n Create a new matrix from a pointer.\n \n \n \n \n \n Create a identity matrix.\n \n The number of rows and columns of the matrix. Must be square.\n The identity matrix.\n \n \n \n Create a matrix filled with the numbers 1, 2. 3, etc to end.\n Used for debugging.\n \n The number of rows.\n The number columns.\n The Matrix.\n \n \n \n \n Create a new matrix fill with random numbers.\n \n The number of rows.\n The number columns.\n The minimum random number generated.\n The maximum random number generated.\n The random generators seed.\n The matrix.\n \n \n \n The number of rows in the matrix.\n \n \n \n \n The number of columns in the matrix.\n \n \n \n \n The total size of the matrix which is \n the rows times the number of columns.\n \n \n \n \n The single dimension array accessor.\n \n The array index.\n The value at the index i.\n \n \n \n The double dimension array accessor.\n \n The row index.\n The column index.\n The value at the index i,j.\n \n \n \n The matrix string info.\n \n The matrix string info.\n \n \n \n The matrix transposed.\n Flips a matrix over its diagonal that is, \n it switches the row and column indices of the matrix.\n \n \n \n \n The matrices conjugate.\n The matrix obtained by replacing each element a(ij) with its complex conjugate, A^=(a^(ij)).\n \n \n \n \n The matrices adjoint.\n The transpose of its cofactor matrix.\n \n \n \n \n Is the matrix invertible.\n \n \n \n \n The inverse of a square matrix A, \n sometimes called a reciprocal matrix, \n is a matrix A^(-1) such that AA^(-1)=I.\n DOes not check if the matrix is invertible.\n \n \n \n \n The determinant is a scalar value that is a \n function of the entries of a square matrix.\n \n \n \n \n The trace of a square matrix is defined to be the \n sum of elements on the main diagonal from the upper left to the lower right.\n \n \n \n \n A square matrix has the same number of rows and columns.\n \n \n \n \n A diagonal matrix is a matrix in which the entries \n outside the main diagonal are all zero.\n \n \n \n \n A square matrix is called upper triangular \n if all the entries below the main diagonal are zero.\n \n \n \n \n A square matrix is called lower triangular \n if all the entries above the main diagonal are zero.\n \n \n \n \n Multiple each component in matrix by the scalar.\n \n The matrix.\n The scalar.\n The matrix with each component multiplied by the scalar.\n \n \n \n Divide each component in matrix by the scalar.\n \n The matrix.\n The scalar.\n The matrix with each component divided by the scalar.\n \n \n \n Multiple the two matrices.\n The first matrices number of columns must \n the same as the second matrices number of rows.\n \n The first matrix.\n The second matrix.\n The product matrix.\n \n \n \n Add two matrices.\n The matrices must be the same size.\n \n The first matrix.\n The second matrix.\n A matrix where each compoent is the sum of the other two matrices.\n \n \n \n Subtract two matrices.\n The matrices must be the same size.\n \n The first matrix.\n The second matrix.\n A matrix where each compoent is the difference of the other two matrices.\n \n \n \n Multiple a matrix and a column vector.\n \n The matrix.\n The column vector.\n The product column vector.\n \n \n \n Is this matrix the identity matrix.\n \n The threshold the values in the \n matrix can be to the expected value.\n Is this matrix the identity matrix.\n \n \n \n Is this matrix filled with zeros.\n \n The threshold the values in the \n matrix can be to the expected value.\n Is this matrix filled with zeros.\n \n \n \n Are all the values in this matrix positive.\n \n Are all the values in this matrix positive.\n \n \n \n Does the matrix have a component that is nan.\n \n Does the matrix have a component that is nan.\n \n \n \n Replaces all nan values in the matrix with 0.\n \n \n \n \n Are all the values in the matrix finite (non-infinite and non-nan).\n \n Are all the values in the matrix finite (non-infinite and non-nan).\n \n \n \n Replaces all infinite and nan values in matrix with 0.\n \n \n \n \n Are all the values in the matrix the same.\n \n The threshold the values in the \n matrix can be to the expected value.\n Are all the values in the matrix the same.\n \n \n \n Create a sub matrix from this matrix.\n \n The row to start at.\n THe column to start at.\n The number of rows.\n The number of columns.\n A sub matrix from this matrix.\n \n \n \n Create a sub matrix from this matrix.\n \n The number of rows.\n The number of columns.\n A sub matrix from this matrix.\n \n \n \n Solve the linear system.\n \n The vector to solve.\n The solver type.\n The solution vector.\n \n \n \n Solve the linear system.\n \n The vector to solve.\n The solver type.\n The solution vector.\n \n \n \n Find the relative error from the linear system.\n \n The vector that was solved.\n The vector that was the solution.\n The relative error.\n \n \n \n Find the relative error from the linear system.\n \n The vector that was solved.\n The vector that was the solution.\n The relative error.\n \n \n \n Find the eigen values of the matrix.\n \n The eigen values if found, null otherwise.\n True if the values could be determined.\n \n \n \n Find the eigen vectors of the matrix.\n \n The eigen vectors if found, null otherwise.\n True if the vectors could be determined.\n \n \n \n \n \n \n \n \n \n \n \n Try and find the inverse of the matrix.\n \n The inverse if found, null otherwise.\n True if the inverse was found.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Create a rotation from a angle and the rotation axis.\n \n The rotation amount.\n The axis to rotate on.\n The rotation matrix.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n /\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The first value in the vector.\n \n \n \n \n The second value in the vector.\n \n \n \n \n The third value in the vector.\n \n \n \n \n The fourth value in the vector.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The generic Box wrapper for a CGAL object.\n \n The kernel type.\n \n \n \n Create box from min and max values.\n \n The min x and y value.\n The max x and y value.\n \n \n \n Create box from min and max points.\n \n The min point.\n The max point.\n \n \n \n Create from a pointer.\n \n The iso rectangle pointer.\n \n \n \n The type of kernel object uses.\n \n \n \n \n The iso rectangle as a string.\n \n The iso rectangle as a string.\n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n Transform the rectangle.\n \n The amount to translate.\n The amount to rotate\n The amount to scale.\n \n \n \n Create a deep copy of the rectangle.\n \n The deep copy.\n \n \n \n The abstract iso rectangle definition.\n \n \n \n \n Default constructor.\n \n \n \n \n \n \n \n \n \n \n \n \n Construct with a new kernel.\n \n The geometry kernel.\n The Box pointer.\n \n \n \n The iso rectangle kernel.\n Contains the functions to the unmanaged CGAL object.\n \n \n \n \n Convert to shape struct.\n \n \n \n \n The rectangles min point.\n \n \n \n \n The rectangles max point.\n \n \n \n \n The rectangles area.\n \n \n \n \n Is the rectangle degenerate.\n \n \n \n \n The side the rectangle the point is on.\n \n The point.\n If the point is iside, outside or on boundary.\n \n \n \n Does the rectangle contain the point.\n \n The point\n Should a point on \n the boundary count as being inside.\n Does the rectangle contain the point\n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n The static intersection class.\n \n \n The static intersection class.\n \n \n The static intersection class.\n \n \n \n --------------------------------------------------------\n \n The Point DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Linet DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Linet DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance functions\n \n --------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance functions\n \n -----------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Linet DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box DoIntersect extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box Intersection extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point SqrDistance extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle SqrDistance extern functions\n \n ------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The IsoRectancle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The IsoRectancle2 Class Functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Point2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Vector2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The HPoint2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Line2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Ray2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Segment2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Triangle2 extern functions\n \n -------------------------------------------------------\n \n \n --------------------------------------------------------\n \n The Box2 extern functions\n \n -------------------------------------------------------\n \n \n \n Weighted point class\n \n \n \n \n \n Create a new weighted point.\n \n \n \n \n Create a new weighted point from a value and weight as 1.\n \n The points value.\n \n \n \n Create a new weighted point from a x, y value and weight as 1.\n \n The points x value.\n The points y value.\n \n \n \n Create a new weighted point from a x, y value and weight as the w value.\n \n The points x value.\n The points y value.\n The points weight value.\n \n \n \n Create a new weighted point from a pointer.\n \n The pointer.\n \n \n \n The type of kernel object uses.\n \n \n \n \n \n \n \n \n \n \n Create a deep copy of the point.\n \n The deep copy.\n \n \n \n \n \n \n \n \n Create a new weighted point.\n \n The points kernel.\n \n \n \n Create a new weighted point from a x, y value and weight as the w value.\n \n The points x value.\n The points y value.\n The points weight value.\n The points kernel.\n \n \n \n Create a new weighted point from a existing ponter and kernel.\n \n The points kernel.\n The points pointer\n \n \n \n The points kernel.\n \n \n \n \n Release the pointer.\n \n \n \n \n Release the pointer.\n \n The pointer to release.\n \n \n \n Accessor or the points x value.\n \n \n \n \n ccessor or the points y value.\n \n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Clamp the point.\n \n The points min value.\n The points max value.\n \n \n \n Clamp the point.\n \n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n Enum for the type of intersection geomerty.\n \n \n \n \n The intersection result struct.\n May contain up tp 6 points of data.\n \n \n \n \n The point data for the intersection.\n Represents up to 6 points in xy order.\n \n \n \n \n The number of points of data used.\n \n \n \n \n Was there a intersection.\n \n \n \n \n Is the intersection a polygon.\n \n \n \n \n The intersection geometry type.\n \n \n \n \n Array accessor for the point data.\n \n The array index from 0 to 6.\n The point at index i.\n \n \n \n Results information as string.\n \n esults information as string\n \n \n \n If result type was point get the point geometry.\n \n \n \n \n If result type was line get the line geometry.\n \n \n \n \n If result type was ray get the ray geometry.\n \n \n \n \n If result type was segment get the segment geometry.\n \n \n \n \n If result type was box get the box geometry.\n \n \n \n \n If result type was triangle get the triangle geometry.\n \n \n \n \n If result type was polygon get the points that\n make up the polygon geometry.\n Should only ever have at most 6 points.\n \n \n \n \n The intersection result as a polygon.\n \n The polygons kernel.\n The polygon.\n \n \n \n A CGALObject that represents a line on 2D space.\n \n \n \n \n \n A horizontal line on the x axis.\n \n \n \n \n A vertical line on the y axis.\n \n \n \n \n Create a new line where ax + by + c = 0 holds.\n \n The constant in ax.\n The constant in by.\n The constant.\n \n \n \n Create a new line that passes through the two points.\n \n The first point.\n The second point.\n \n \n \n Create a line that passes through the point in the direction of the vector.\n \n The point.\n The vector.\n \n \n \n Create a line from a existing pointer.\n \n The pointer.\n \n \n \n Create a new line that faces in the opposite direction.\n \n \n \n \n \n \n \n \n \n \n Create a new line that is perpendicular to current line.\n \n A point the line should turn ccw when turning.\n The perpendicular line.\n \n \n \n Translate the object.\n \n The amount to translate.\n \n \n \n Rotate the object.\n \n The amount to rotate.\n \n \n \n Scale the object.\n \n The amount to scale.\n \n \n \n Translate, rotate and scale the object.\n \n The amount to translate.\n The amount to rotate in degrees.\n The amount to scale.\n \n \n \n Create a deep copy of the line.\n \n The deep copy.\n \n \n \n The abstract class for the line object.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The lines kernel.\n \n \n \n \n Convert to shape struct.\n \n \n \n \n The lines constant in ax.\n \n \n \n \n The lines constant in by.\n \n \n \n \n The lines constant.\n \n \n \n \n Is the line degenerate.\n \n \n \n \n Is the line horizontal on the x axis.\n \n \n \n \n Is the line vertical on the y axis.\n \n \n \n \n Convert the line to a vector.\n \n \n \n \n Does the point lie on the line.\n \n The point.\n True if the point lies on the line.\n \n \n \n Does the point lies on the negative/cw side of the line.\n \n The point.\n True if the point lies on the negative/cw side of the line.\n \n \n \n Does the point lies on the positive/ccw side of the line.\n \n The point.\n True if the point lies on the positive/ccw side of the line.\n \n \n \n The lines x value given a y value.\n \n The y value.\n The lines x value given a y value.\n \n \n \n The lines y value given a x value.\n \n The x value.\n The lines y value given a x value.\n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n The unit x point.\n \n \n \n \n The unit y point.\n \n \n \n \n A point of zeros.\n \n \n \n \n A point of ones.\n \n \n \n \n A point of halfs.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The type of kernel object uses.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the point.\n \n The number of digits to round to.\n \n \n \n Clamp the point.\n \n The points min value.\n The points max value.\n \n \n \n Clamp the point.\n \n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n The unit x ray.\n \n \n \n \n The unit y ray.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Convert to shape struct.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n A horizontal line on the x axis.\n \n \n \n \n A vertical line on the y axis.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Convert to shape struct.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the shape.\n \n The amount to translate.\n \n \n \n Rotate the shape.\n \n The amount to rotate.\n \n \n \n Scale the shape.\n \n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Convert to shape struct.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Round the shape.\n \n The number of digits to round to.\n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n A Vector2 object with kernel type K.\n \n The type of kernel.\n \n \n \n The unit x vector.\n \n \n \n \n The unit y vector.\n \n \n \n \n A vector of zeros.\n \n \n \n \n A vector of ones.\n \n \n \n \n Create a new Vector.\n \n \n \n \n Create a new vector filled with the value.\n \n The value to fill.\n \n \n \n Create a new vector with the values x and y.\n \n The vectors x value.\n The vectors y value.\n \n \n \n Create a new vector from a existing pointer.\n \n The pointer object.\n \n \n \n The type of kernel object uses.\n \n \n \n \n Vector information.\n \n The vectors string information.\n \n \n \n Create a deep copy of the vector.\n \n The deep copy.\n \n \n \n The vectors abstract bass class.\n \n \n \n \n Create a new vector with the kernel.\n \n The vectors kernel.\n \n \n \n Create a new vector from the x and y values.\n \n The vectors x value.\n The vectors y value.\n The vectors kernel.\n \n \n \n Create a new vector from a existing pointer.\n \n The vectors kernel.\n The existing pointer.\n \n \n \n The vectors kernel.\n \n \n \n \n The vectors sqr magnitude.\n \n \n \n \n The vectors sqr magnitude.\n \n \n \n \n Access the x component.\n \n \n \n \n Access the y component.\n \n \n \n \n Release the vectors pointer.\n \n \n \n \n Release a pointer to a vector.\n \n The pointer to release.\n \n \n \n Round the vector.\n \n The number of digits to round to.\n \n \n \n Clamp the vector.\n \n The vectors min value.\n The vectors max value.\n \n \n \n Clamp the vector.\n \n \n \n \n Normalize the vector.\n \n \n \n \n Convert to another kernel.\n Must provide a different kernel to convert to or\n just a deep copy will be returned.\n \n The shape with another kernel type.\n \n \n \n The convex hull method to use.\n \n \n \n \n The generic convex hull class.\n \n The kernel type\n \n \n \n The static instance.\n \n \n \n \n Default constructor.\n \n \n \n \n \n \n \n \n \n \n Find the convex of the points.\n \n The point array.\n The ararys length.\n The hull ethod to use.\n A polygon that represents the convex hull.\n \n \n \n Find the upper hull of points.\n \n The point array.\n The ararys length.\n A polygon that represents the upper hull.\n \n \n \n Find the lower hull of points.\n \n The point array.\n The ararys length.\n A polygon that represents the lower hull.\n \n \n \n The convex hull abstract base class.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct hull with the kernel.\n \n The kernel\n \n \n \n The hulls kernel type.\n \n \n \n \n Is this set of points ccw orderer.\n \n The point array.\n The ararys length.\n Is this set of points ccw orderer.\n \n \n \n Is this set of points cw orderer.\n \n The point array.\n The ararys length.\n Is this set of points cw orderer.\n \n \n \n Checks if the minimum number of points have been provided.\n \n The point array length.\n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n The generic convex hull class.\n \n The kernel type\n \n \n \n The static instance.\n \n \n \n \n Default constructor.\n \n \n \n \n \n \n \n \n \n \n Create the convex hull from a set of points.\n \n The point array.\n The point arrays length\n The hull as a polyhedron.\n \n \n \n Create the convex hull from a set of points.\n \n The point array.\n The point arrays length\n The hull as a surface mesh.\n \n \n \n The convex hull abstract base class.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct hull with the kernel.\n \n The kernel\n \n \n \n The hulls kernel type.\n \n \n \n \n Check if the points in the polyhedron are convex.\n \n The polyhedron.\n True if the polyhedron is convex.\n \n \n \n Check if the points in the mesh are convex.\n \n The mesh.\n True if the mesh is convex.\n \n \n \n Checks if the minimum number of points have been provided.\n \n The point array length.\n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n A static instance of the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as a string.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retain the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retain the poylgons edges.\n \n The polygon to insert.\n \n \n \n A deep copy of the triangulation.\n \n The deep copy.\n \n \n \n \n \n \n \n \n The max value the angle bounds can be.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The number of verices in the triangulation.\n \n \n \n \n The number of triangles in the triangulation.\n \n \n \n \n The number of indices need to represent the\n triangulation (number of triangles * 3).\n \n \n \n \n The conforming triangulation kernel.\n \n \n \n \n Clear the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Translate the triangulation.\n \n The amount to translate.\n \n \n \n Rotate the triangulation.\n \n The amount to rotate in radians.\n \n \n \n Scale the triangulation.\n \n The amount to scale.\n \n \n \n Transform the triangulation with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Make the mesh delaunay.\n \n \n \n \n Make the mesh \n \n \n \n \n Refine the mesh into smaller triangles.\n \n Default shape bound. 0.125 corresponds to abound 20.6 degree. Max 0.125 value.\n Upper bound on the length of the longest edge.\n \n \n \n Refine the mesh into smaller triangles.\n \n Default shape bound. 0.125 corresponds to abound 20.6 degree. Max 0.125 value.\n Upper bound on the length of the longest edge.\n Seeds point in polygons that are not to be refined.\n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n A static instance of the tetrahedral remeshing.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The tetrahedral remeshing kernel.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Generic polygon definition.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Create from a set of points.\n \n The polygons points.\n \n \n \n Create from a pointer.\n \n The polygons pointer.\n \n \n \n The polygon as a string.\n \n The polygon as a string.\n \n \n \n Copy the polygon.\n \n The copied polygon.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n The intersection results.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n The intersection results.\n Do the polygons intersect.\n \n \n \n Refine the polygon to a triangulation.\n Does not modify this polygon.\n \n Upper bound on the length of the longest edge.\n The base triangulation.\n \n \n \n Refine the polygon to a triangulation.\n Does not modify this polygon.\n \n Default shape bound. 0.125 corresponds to abound 20.6 degree. Max 0.125 value.\n Upper bound on the length of the longest edge.\n The base triangulation.\n \n \n \n Partition the polygon into convex pieces.\n Does not modify this polygon.\n \n The convex partition.\n The type of partition method.\n \n \n \n Simplify the polygon.\n \n The simplification threshold.\n \n \n \n Simplify the polygon.\n \n The simplification parameters.\n \n \n \n offset the polygon. Does not modify this polygon.\n \n The type of offset.\n The amount to offset.\n The offset results.\n \n \n \n Create a polyhedron3 mesh with one polygon face.\n \n Should the y coord of the points be used for the z coord.\n The new polyhedron mesh\n Thrown if the polygon is not simple.\n \n \n \n Get the dual polygon where every point s now a edge.\n \n The dual polygon.\n \n \n \n The abstract polygon definition.\n \n \n \n \n Is the polygon simple.\n Must be updated to find if simple.\n \n \n \n \n The polygons orientation.\n Must be updated to find orientation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The polygon kernel.\n \n \n \n Construct with a new kernel.\n \n The polygon kernel.\n The points to construct from.\n \n \n \n Construct with a new kernel.\n \n The polygon kernel.\n The polygons pointer.\n \n \n \n The number of points in the polygon.\n \n \n \n \n The capacity of the point array.\n \n \n \n \n Is this a simple polygon.\n Certains actions can only be carried out on simple polygons.\n \n \n \n \n The polygons orientation.\n Certain actions depend on the polygons orientation.\n \n \n \n \n The orientation expressed as the clock direction.\n \n \n \n \n Is the polygon degenerate.\n Polygons with less than 3 points are degenerate.\n \n \n \n \n Is the polygon cw orientated.\n \n \n \n \n Is the polygon ccw orientated.\n \n \n \n \n Is the polygon updated.\n \n \n \n \n The polygons kernel.\n Contains the functions to the unmanaged CGAL polygon.\n \n \n \n \n The type of kernel object uses.\n \n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n \n \n \n \n \n Mark th mesh as needing to be updated.\n \n \n \n \n Valid polygons should be simple and ccw \n for most algorithms to work on them.\n \n \n \n \n Valid hole polygons should be simple\n and cw to add to a polygon with holes.\n \n \n \n \n Clear the polygon of all points.\n \n \n \n \n Shrink the capacity to match the point count.\n \n \n \n \n Resize the point array.\n New elements will default to zero.\n \n \n \n \n \n Remove the point at the index from the array.\n \n The points index\n \n \n \n Remove a range of points from the array.\n \n The starting index\n The number of points to remove.\n \n \n \n Insert the point at the index into the array.\n \n The points index.\n The point to insert.\n \n \n \n Insert a range of points into the array.\n \n The starting index\n The points to insert.\n The number of points to insert.\n \n \n \n Add the point to the end of the poylgon.\n \n The point to add.\n \n \n \n Get the point a the index.\n \n The points index to get.\n The point at index.\n \n \n \n Get the point at the index\n and wrap around the polygon.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polygons last point.\n \n The points index.\n The point at the index.\n \n \n \n Get all the points in the polygon.\n \n The point array to copy the data into.\n The array length.\n \n \n \n Get all the polygon points.\n \n The list to copy the data into.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Get all the polygon segments.\n \n The segment array to copy the data into.\n The array length.\n \n \n \n Set the points at the index.\n \n The points index.\n The points value.\n \n \n \n Set the points from the array.\n If the array is larger than the polygon then \n the new points will be appended to end of polygon.\n \n The points array.\n The array length.\n \n \n \n Reverse the polygon.\n Swithches the orientation.\n \n \n \n \n Find the bounding box for the polygon.\n \n The bounding box.\n \n \n \n Find if the polygon is simple.\n \n True if simple.\n \n \n \n Find if the polygon is convex.\n Must be simple to determine.\n \n True if the polygon is convex.\n \n \n \n Find the polygons orientation.\n Must be simple to determine.\n \n The polygons orientations.\n \n \n \n Find the orientated side the point lies on.\n Must be simple to determine.\n \n The point.\n The orientated side of the polygon the point is on.\n \n \n \n Find the bounded side the point lies on.\n Must be simple to determine.\n \n The point.\n The bounded side of the polygon the point is on.\n \n \n \n Find the polygons signed area. \n Must be simple to determine.\n \n The signed area is positive if polygon is ccw \n and negation if cw.\n \n \n \n The area of the polygon.\n Must be simple to determine.\n \n The abs of the signed area.\n \n \n \n Find the perimeter.\n This is the length of the polygon boundary.\n \n \n \n \n \n Find the square perimeter.\n This is the square length of the polygon boundary.\n \n \n \n \n \n Does the polygon contain the points.\n Must be simple to determine.\n \n The point to find.\n Does the point on the boundary count\n True if the point is inside the polygon.\n \n \n \n Round each point it polygon to a number of digits.\n \n The number of digits to round to.\n \n \n \n Translate the polygon.\n \n The amount to translate.\n \n \n \n Rotate the polygon.\n \n The amount to rotate in radians.\n \n \n \n Scale the polygon.\n \n The amount to scale.\n \n \n \n Transform the polygon with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Return all the points in the polygon in a array.\n \n The array.\n \n \n \n Get all the points in the polygon into a list.\n \n \n \n \n Convert the polygon to a new polygon with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polygon.\n \n \n \n Truncate a point in the polygon by splitting\n the point and shifting toward its neghbours.\n \n The points index in mesh.\n The amount to truncale.\n \n \n \n Print the polygon into a styring builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Update the polygon if needed.\n \n \n \n \n Update the polygon directly without calling the update\n function.\n \n Is the polygon simepl.\n The polygons orientation.\n \n \n \n Should the input polygon be checked.\n Can disable for better performance if \n it is know all input if valid.\n \n \n \n \n Check if the polygon is valid to offset.\n Should be simple and ccw.\n \n The polygon to check.\n \n \n \n Check if the polygon is valid to offset.\n Should be simple and ccw.\n \n The polygon to check.\n \n \n \n The type of boolean ops.\n \n \n \n \n Generic polygon boolean class.\n \n The type of kernel\n \n \n \n A static instance to the boolean class.\n \n \n \n \n Create a new object.\n \n \n \n \n \n \n \n \n \n \n Perform the boolean op on the two polygons.\n \n The type of op.\n A simple ccw polygon.\n A simple ccw polygon.\n The result of the op.\n If the op was performed and the result list changed.\n \n \n \n Perform the boolean op on the two polygons.\n \n The type of op.\n A simple ccw polygon.\n A simple ccw polygon.\n The result of the op.\n If the op was performed and the result list changed.\n \n \n \n Perform the boolean op on the two polygons.\n \n The type of op.\n A simple ccw polygon.\n A simple ccw polygon.\n The result of the op.\n If the op was performed and the result list changed.\n \n \n \n Check if the polygons intesect.\n \n A simple ccw polygon.\n A simple ccw polygon.\n If the polygons intesect.\n \n \n \n Check if the polygons intesect.\n \n A simple ccw polygon.\n A simple ccw polygon.\n If the polygons intesect.\n \n \n \n Check if the polygons intesect.\n \n A simple ccw polygon.\n A simple ccw polygon.\n If the polygons intesect.\n \n \n \n The union of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The union of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The union of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The union of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The union of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The union of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The intersection of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The intersection of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The intersection of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The intersection of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The intersection of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The intersection of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The symmetric difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The symmetric difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The symmetric difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The symmetric difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The symmetric difference of the two polygons.\n \n A simple ccw polygon.\n A simple ccw polygon.\n The symmetric difference of the polygons.\n If the op was performed and the result list changed.\n \n \n \n The complement of the polygon.\n \n A simple ccw polygon.\n The complement of the polygon.\n \n \n \n Copy the unmanaged polygon objects created \n into the result list.\n \n The number of objects in the buffer.\n The result lis.\n \n \n \n Copy the unmanaged polygon object.\n \n The index of the polygon in the buffer.\n The polygon copy.\n \n \n \n Abstract base class for polygon boolean.\n \n \n \n \n The polygon boolean kernel.\n \n \n \n \n Clear the unmanaged buffer.\n \n \n \n \n Release the unmanaged resourses.\n \n \n \n \n Factory for creating polygons.\n \n The kernel type.\n \n \n \n Create a empty polygon.\n \n \n \n \n \n Create a polygon from a triangle.\n \n The triangle first point.\n The triangle second point.\n The triangle third point.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a triangle.\n \n The triangle.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a box.\n \n The boxs min point.\n The boxs max point.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a box.\n \n The boxs min point.\n The boxs max point.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a box.\n \n The box.\n True for a counter clock wise polygon, false for a clock wise polygon\n The created polygon.\n \n \n \n Create a polygon from a dounut.\n Outer radius must be greater than inner.\n \n The outer radius.\n The inner radius\n The number of segments.\n The created polygon with holes\n \n \n \n Create a polygon from a dounut.\n Outer radius must be greater than inner.\n \n The center position of the polygon.\n The outer radius.\n The inner radius\n The number of segments.\n The created polygon with holes\n \n \n \n Create a polygon from a circle.\n \n The radius of the circle.\n The number of segments.\n True for a counter clock wise polygon, false for a clock wise polygon\n The polygon.\n \n \n \n Create a polygon from a circle.\n \n The center of the circle.\n The radius of the circle.\n The number of segments.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n Create a polygon from a circle.\n \n The cirlce.\n The number of segments.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n https://rosettacode.org/wiki/Koch_curve#C.2B.2B\n \n The size of the polygon.\n The number of times to sub divide.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n https://rosettacode.org/wiki/Koch_curve#C.2B.2B\n \n The stars center.\n The size of the polygon.\n The number of times to sub divide.\n True for a counter clock wise polygon, false for a clock wise polygon\n \n \n \n \n https://rosettacode.org/wiki/Koch_curve#C.2B.2B\n \n \n \n \n \n \n Decomposition stratergy for polygons.\n \n \n \n \n Decomposition stratergy for polygons with holes.\n \n \n \n \n Generic Minkowski class.\n \n The type of kernel\n \n \n \n A static instance to the Minkowski class.\n \n \n \n \n Create a new object.\n \n \n \n \n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n The decomposition method.\n \n \n \n \n \n \n Compute the Minkowski sum of two polygons.\n \n The decomposition method.\n \n \n \n \n \n \n It is based on the angle-bisector decomposition method suggested by Chazelle and Dobkin [4],\n which runs in O(n2) time. In addition, it applies a heuristic by Flato that reduces the number\n of output polygons in many common cases. The convex decompositions that it produces usually \n yield efficient running times for Minkowski sum computations. It starts by examining each pair \n of reflex vertices in the input polygon, such that the entire interior of the diagonal \n connecting these vertices is contained in the polygon. Out of all available pairs, the vertices\n pi and pj are selected, such that the number of reflex vertices encountered when traversing \n the boundary of the polygon from pi to pj in clockwise order is minimal. The polygon is split \n by the diagonal pipj. This process is repeated recursively on both resulting sub-polygons. \n In case it is not possible to eliminate two reflex vertices at once any more, each reflex \n vertex is eliminated by a diagonal that is closest to the angle bisector emanating from this \n vertex and having rational-coordinate endpoints on both sides.\n \n \n \n \n \n \n \n Uses the dynamic-programming algorithm of Greene [6] for computing an optimal decomposition of \n a polygon into a minimal number of convex sub-polygons. While this algorithm results in a small\n number of convex polygons, it consumes rather many resources, as it runs in O(n4) time and O(n3) \n space in the worst case, where n is the number of vertices in the input polygon.\n \n \n \n \n \n \n \n Implements the approximation algorithm suggested by Hertel and Mehlhorn [8], which triangulates \n the input polygon and then discards unnecessary triangulation edges. After triangulation (carried \n out by the constrained-triangulation procedure of CGAL) the algorithm runs in O(n) time and space,\n and guarantees that the number of sub-polygons it generates is not more than four times the optimum.\n \n \n \n \n \n \n \n Implementation of Greene's approximation algorithm [6], which computes a convex decomposition of the \n polygon based on its partitioning into y-monotone polygons. This algorithm runs in O(nlogn) time and \n O(n) space, and has the same guarantee on the quality of approximation as Hertel and Mehlhorn's algorithm.\n \n \n \n \n \n \n \n Uses vertical decomposition to decompose the underlying arrangement.\n \n \n \n \n \n \n \n Uses vertical decomposition to decompose the underlying arrangement.\n \n \n \n \n \n \n \n Uses constrained triangulation to decompose the input polygons, which may have holes, into triangles.\n \n \n \n \n \n \n \n Uses constrained triangulation to decompose the input polygons, which may have holes, into triangles.\n \n \n \n \n \n \n \n Abstract base class for polygon minkowski.\n \n \n \n \n The polygon Minkowski kernel.\n \n \n \n \n Release the unmanaged resourses.\n \n \n \n \n The generic polgon offset class\n \n \n \n \n \n Static instance of polygon offset.\n \n \n \n \n Create new polygon offset.\n \n \n \n \n \n \n \n \n \n \n Create a interior or exterior offset.\n \n The offset type\n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a interior or exterior offset.\n \n The offset type\n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a interior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a interior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a exterior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create a exterior offset.\n \n The polygon to offset.\n The offset amount\n The offset polygon\n \n \n \n Create the interior skeleton of the polygon.\n \n The polygon to offset.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n Create the interior skeleton of the polygon.\n \n The polygon to offset.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n Create the exterior skeleton of the polygon.\n \n The polygon to offset.\n The bounding boxes offset from the polygons edges. Must be > 0.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n Create the exterior skeleton of the polygon.\n \n The polygon to offset.\n The bounding boxes offset from the polygons edges. Must be > 0.\n Should the polygon be included as the border.\n The skeletons segments.\n \n \n \n The abstract polygon offset class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The offset kernel.\n \n \n \n \n Get the number off polygons in the buffer.\n \n \n \n \n \n The size of the segment buffer.\n \n The number of segments in the buffer.\n \n \n \n Get the unmanaged point to the polygon at the buffer index\n \n The index in the buffer.\n The pointer\n \n \n \n Get the segment from buffer.\n \n The segments index.\n The segment.\n \n \n \n Clear the polygon buffer.\n \n \n \n \n Clear the segment buffer.\n \n \n \n \n Release the unmanaged resources.\n \n \n \n \n Type of polygon partitions.\n \n \n \n \n Generic polygon partition class.\n \n The kernel type.\n \n \n \n Static instance of polygon partition.\n \n \n \n \n Create new polygon partition.\n \n \n \n \n \n \n \n \n \n \n Is this polygon Y monotonic.\n \n The polygon.\n True if y monotonic.\n \n \n \n Is this polygon Y monotonic.\n \n The polygon.\n True if y monotonic.\n \n \n \n Partition a polygon.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition a polygon.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition a polygon.\n \n The type of partition to perfrom.\n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition a polygon.\n \n The type of partition to perfrom.\n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition in to Y monotonic polygons.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition in to Y monotonic polygons.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of\n convex polygons produced is no more than four times the minimal number.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of \n convex polygons produced is minimal.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Partition the polygon into convex polygons where the number of \n convex polygons produced is minimal.\n \n The polygon to partition.\n The resulting polygons.\n \n \n \n Copy the new polygons into the result array\n and the clear the buffer.\n \n The number of polygons in buffer.\n The resulting polygons.\n \n \n \n The abstract base class.\n \n \n \n \n The partition kernel.\n \n \n \n \n Clear the unmanaged buffer.\n \n \n \n \n Release the unmanaged resources.\n \n \n \n \n Cost options for simplification.\n \n \n \n \n Stop distance options for simplification.\n \n \n \n \n Paramaters for poylgon simplification.\n \n \n \n \n The default param settings.\n \n \n \n \n The param as a string.\n \n \n \n \n \n Generic polygon simplification class.\n \n The kernel type.\n \n \n \n Static instance of polygon simplification.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Simplify the polygon.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify the polygon.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon ptr.\n \n \n \n Simplify the polygons boundary and all the holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify the polygons boundary and all the holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygons ptr.\n \n \n \n Simplify the polygons boundary.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify the polygons holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The simplified polygon.\n \n \n \n Simplify one of the polygons holes.\n \n The polygon to simplify. Must be simple.\n The simplification parameters.\n The hole index to simplify.\n The simplified polygon.\n \n \n \n Abstract polygon simplification class.\n \n \n \n \n The simplification kernel.\n \n \n \n \n Release unmanaged resources.\n \n \n \n \n The generic polgon visibility class\n \n \n \n \n \n Static instance of polygon visibility.\n \n \n \n \n Create new polygon visibility.\n \n \n \n \n \n \n \n \n \n \n Compute the visibility from a simple polygon with no holes.\n This class implements the algorithm of B.Joe and R.B.Simpson [4]. The algorithm is a modification\n and extension of the linear time algorithm of Lee [5]. It computes the visibility region from a \n viewpoint that is in the interior or on the boundary of the polygon.\n While scanning the boundary the algorithm uses a stack to manipulate the vertices, and ultimately\n yields the visibility region.For each scanned edge, at most 2 points are pushed onto the stack.\n Overall, at most 2 n points are pushed or popped. Thus, the time and space complexities of the\n algorithm are O(n) even in case of degeneracies such as needles, where n is the number of the vertices of the polygon.\n \n The visibility point.\n A simple polygon that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes.\n \n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes.\n \n What method to use.\n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes using the triangular expansion method.\n The algorithm does not require preprocessing. It relies on the algorithm of T. \n Asano [1] based on angular plane sweep, with a time complexity of O(nlogn) in the number of vertices.\n \n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n Compute the visibility from a polygon with holes using the rotational sweep method.\n The algorithm obtains a constrained triangulation from the input arrangement, then computes visibility by \n expanding the triangle that contains the query point. Preprocessing takes O(n) time and O(n) space, where \n n is the number of vertices of input polygon. The query time is O(nh), where h is the number of holes+1 of \n input polygon. Thus, for simple polygons (or a polygon with a constant number of holes) the algorithm \n complexity is linear, but it is O(n2) in the worst case, as the number of holes can be linear in n.\n \n The visibility point.\n A polygon with holes that contains the point.\n The visibility result.\n True if result was computed\n \n \n \n The abstract polygon visibility class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The offset kernel.\n \n \n \n \n Release the unmanaged resources.\n \n \n \n \n Polygon with holes consists of a boundary and holes.\n \n \n \n \n Generic polygon definition.\n \n The kernel type.\n \n \n \n Default constuctor.\n \n \n \n \n Construct polygon with the boundary.\n \n A CCW polygon.\n \n \n \n Construct polygon with the boundary points\n \n A CCW set of points.\n \n \n \n Create from a pointer.\n \n The polygons pointer.\n \n \n \n The polygon as a string.\n \n The polygon as a string.\n \n \n \n Create a deep copy of the polygon.\n \n The copy.\n \n \n \n Create a deep copy of the polygon element.\n \n The element type to copy.\n If element os a hole thiss is the holes index.\n The copy.\n \n \n \n Get the boundary as a copy.\n If unbounded will return a empty polygon.\n \n A copy of the hole polygon.\n \n \n \n Get the hole as a copy.\n \n The holes index\n A copy of the hole polygon.\n \n \n \n Add a polygon as a holes.\n Holes must simple and CW.\n \n The hole polygon.\n \n \n \n Create a copy of boundary and hole polygons.\n \n The list of polygons.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Do the polygons intersect.\n \n The other polygon.\n Do the polygons intersect.\n \n \n \n Connect all the holes of the polygon \n and return as a polygon. \n Will result in a non simple polygon.\n \n The connected non-simple polygon.\n \n \n \n Partition the polygon into convex pieces.\n \n The convex partition.\n The type of partition method.\n \n \n \n Simplify the polygon.\n \n The simplification threshold.\n \n \n \n Simplify the polygon.\n \n The simplification parameters.\n \n \n \n offset the polygon. Does not modify this polygon.\n \n The type of offset.\n The amount to offset.\n The offset results.\n \n \n \n The abstract polygon definition.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct polygon with the kernel.\n \n \n \n \n \n Construct the polygon with the kernel and boundary.\n \n \n A CCW polygon.\n \n \n \n Construct the polygon with the kernel and boundary.\n \n \n A CCW set of points.\n \n \n \n Construct the polygon with the kernel and pointer.\n \n \n \n \n \n \n Is the polygon unbounded. \n ie no boundary polygon has been set.\n \n \n \n \n Is the polygon bounded. \n ie a boundary polygon has been set.\n \n \n \n \n Number of points in the boindary polygon.\n \n \n \n \n The number of holes in polygon.\n \n \n \n \n Is this a simple polygon.\n Certains actions can only be carried out on simple polygons.\n \n \n \n \n The polygons orientation.\n Certain actions depend on the polygons orientation.\n \n \n \n \n The orientation expressed as the clock direction.\n \n \n \n \n Is the polygon degenerate.\n Polygons with less than 3 points are degenerate.\n \n \n \n \n Is the polygon cw orientated.\n \n \n \n \n Is the polygon ccw orientated.\n \n \n \n \n The polygon kernel.\n \n \n \n \n The type of kernel object uses.\n \n \n \n \n Valid polygon with holes must have a simple and ccw boundary\n and all holes must be simple and cw.\n \n \n \n \n \n Valid holes must be simple, cw and must be contained\n within the boundary polygon.\n \n \n \n True if the polygon is a valid hole.\n \n \n \n Clear the polygon.\n \n \n \n \n Clear the polygons boundary.\n \n \n \n \n Clear the polygons holes.\n \n \n \n \n Get the number of points of a polygon element.\n \n The element type.\n If element type is a hole this is the holes index.\n \n \n \n \n Remove a polygon.\n Can remove the boundary or a hole.\n \n The element type.\n If element type is a hole this is the holes index.\n \n \n \n Remove a hole from the polygon.\n \n The holes index.\n \n \n \n Reverse the polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n \n \n \n Get a polygons point.\n \n The element type.\n The index of the point in the polygon.\n If element type is a hole this is the holes index.\n \n \n \n \n Get the points in the polygon element.\n \n The element type.\n The point array to copy points into.\n The ararys length.\n If element type is a hole this is the holes index.\n \n \n \n Set a polygons point.\n \n The element type.\n The index of the point in the polygon.\n The point to set.\n If element type is a hole this is the holes index.\n \n \n \n Set all the points in the polygon. If the point array is longer\n than the polygon is current the extra points are appended to the end.\n \n The element type.\n The points to set.\n The ararys length.\n If element type is a hole this is the holes index.\n \n \n \n Triangulate the polygon.\n \n The triangle indices.\n \n \n \n Add a hole from a set of points.\n \n A CW set of points.\n The ararys length.\n \n \n \n Find if the polygon has a boundary.\n \n True if the polygon has a boundary.\n \n \n \n Find the polygons bounding box.\n \n The element type.\n If element type is a hole this is the holes index.\n The polygons bounding box.\n \n \n \n Find if the polygon is simple.\n \n The element type.\n If element type is a hole this is the holes index.\n True if the polygon is simple.\n \n \n \n Find if the polygon is convex.\n \n The element type.\n If element type is a hole this is the holes index.\n True if polygon is convex.\n \n \n \n Find the orientation of polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n The orientation of the polygon.\n \n \n \n Find the orientated side the point is on.\n \n The element type.\n \n If element type is a hole this is the holes index.\n The orientated side of point compared to the polygon.\n \n \n \n The signed area of the polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n The signed area is positive if polygon is ccw \n and negation if cw.\n \n \n \n The area of the polygon.\n \n The element type.\n If element type is a hole this is the holes index.\n The polygons area.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Enumerate all points in the polygon.\n \n Each point in polygon.\n \n \n \n Return all the points in the polygon in a array.\n \n The array.\n \n \n \n Get all the points in the polygons boundary into a list.\n \n \n \n \n Get all the points in the polygon boundary and holes.\n \n The point array to copy into.\n \n \n \n Round each point it polygon to a number of digits.\n \n The number of digits to round to.\n \n \n \n Convert the polygon to a new polygon with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polygon.\n \n \n \n Release the unmanaged resoures.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Does the polygon fully contain the other polygon.\n \n The other polygon.\n Should the boundary be included.\n True if the polygon is contained within this polygon.\n \n \n \n Does this polygon contain the point.\n \n The point.\n Should points on the boundary be \n counted as being inside the polygon.\n True if the polygon contain the point.\n \n \n \n Translate the polygon.\n \n The amount to translate.\n \n \n \n Translate the polygon.\n \n The element type.\n The amount to translate.\n If element type is a hole this is the holes index.\n \n \n \n Rotate the polygon.\n \n The amount to rotate in radians.\n \n \n \n Rotate the polygon.\n \n The element type.\n The amount to rotate in radians.\n If element type is a hole this is the holes index.\n \n \n \n Rotate the polygon.\n \n The amount to scale.\n \n \n \n Scale the polygon.\n \n The element type.\n The amount to scale.\n If element type is a hole this is the holes index.\n \n \n \n Transform the polygon.\n \n The amount to translate.\n The amount to rotate in radians.\n The amount to scale.\n \n \n \n Transform the polygon.\n \n The element type.\n The amount to translate.\n The amount to rotate in radians.\n The amount to scale.\n If element type is a hole this is the holes index.\n \n \n \n Print debug infomation.\n \n \n \n \n \n Number of vertices.\n \n \n \n \n Number of faces.\n \n \n \n \n Number of halfedges.\n \n \n \n \n Number of border edges.\n Since each border edge of a polyhedral surface has exactly one \n border halfedge, this number is equal to size of border halfedges.\n \n \n \n \n Returns true if the polyhedral surface is combinatorially consistent.\n Must be a valid mesh to check many other properties.\n \n \n \n \n Returns true if there are no border edges.\n \n \n \n \n Returns true if all faces are triangles.\n \n \n \n \n Returns true if all faces are quads.\n \n \n \n \n Is this a valid triangle mesh.\n \n \n \n \n Is this a valid closed mesh.\n \n \n \n \n Is this a valid closed triangle mesh.\n \n \n \n \n The current build stamp.\n \n \n \n \n Clear the mesh.\n \n \n \n \n Clear the normal maps.\n \n True to clear the vertex normal map.\n True to clear the face normal map. \n \n \n \n Create a mesh from the points and indices.\n \n The meshes points.\n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Create a triangle mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a quad mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a mesh with quads and triangles.\n \n The meshes points.\n The point array length.\n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Create a mesh with riangles, quads, pentagons and hexagons.\n \n The meshs points.\n The length of the point array.\n The faces indices.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces points\n The length of the point array.\n Should the y coord of the points be used for the z coord.\n \n \n \n Get the triangle and quad indices.\n \n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Get the meshes triangles.\n \n The meshes triangles.\n The triangle array length.\n \n \n \n Get the meshes quads.\n \n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles and quads.\n \n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles, quads, pentagons and hexagons.\n \n The indices.\n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n The points index.\n The vertices point.\n \n \n \n Get the vertices point.\n \n The vertex index in the mesh.\n The vertices point.\n If index is out of range.\n \n \n \n Get the points in the mesh.\n \n The array to copy points into.\n The point array length.\n \n \n \n Set the point at the index.\n \n The points index\n The pointsam>\n If index is out of range.\n \n \n \n Set the points from a array.\n \n The point array.\n The point arrays length.\n \n \n \n Get a halfedges segment.\n \n The halfedges index.\n The segment.\n True if halfedge found.\n \n \n \n Get a segment for each halfedge in the mesh.\n \n The segment array.\n The segment array length.\n \n \n \n Get the faces triangle. \n Presumes face is a triangle with no checks.\n \n The faces index.\n The faces triangle\n \n \n \n \n Get a triangle for each face in the mesh.\n Presumes all faces are triangles with no checks.\n \n The trainagle array.\n The traingle arrays length.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the vertices in the mesh.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n True if the face was found.\n \n \n \n Get the faces in the mesh.\n \n The face array.\n The face array length.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n The halfedge.\n True if the halfedge was found.\n \n \n \n Get the halfedges in the mesh.\n \n The halfedge array.\n The halfedge array length.\n \n \n \n Count the number of triangles, quads and polygons in the mesh.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Count the number of triangles, quads and polygons in the dual mesh.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Get a centroid (the avergae face position) for each face in the mesh.\n \n The point array.\n The points arrays lemgth.\n \n \n \n Computes the vertex normals if needed.\n \n \n \n \n Computes the face normals if needed.\n \n \n \n \n Get the vertex normals.\n \n The normals array.\n The normals array length.\n \n \n \n Get the face normals.\n \n The normals array.\n The normals array length.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Make all faces triangles.\n \n \n \n \n Read data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Write data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Print the mesh into a string builder.\n \n \n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Find what side of the mesh the lies in.\n \n The point to check.\n ON_BOUNDED_SIDE if point inside mesh, \n ON_UNBOUNDED_SIDE if point not inside, \n ON_BOUNDARY if point is on the surface.\n \n \n \n Does the mesh contain the point.\n \n The point.\n If point is on the boundary does it count a being contained.\n True if the poly contains the point\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n Locate the face hit by the ray.\n \n The ray.\n The hit face.\n True if the ray hit a face.\n \n \n \n Locate the vertex hit by the ray.\n \n The ray.\n The distance the vertex has to be within hit point.\n The hit vertex.\n True if the ray hit a vertex.\n \n \n \n Locate the edge hit by the ray.\n \n The ray.\n The distance the edge has to be within hit point.\n The hit edge.\n True if the ray hit a edge.\n \n \n \n The faces index\n \n \n \n \n THe faces edge\n \n \n \n \n A face where all compents are null index.\n \n \n \n \n \n \n \n \n \n \n Are these faces equal.\n \n \n \n \n \n \n \n Are these faces not equal.\n \n \n \n \n \n \n \n Are these objects equal.\n \n \n \n \n \n \n Are these faces equal.\n \n \n \n \n \n \n The faces hash code.\n \n \n \n \n \n Enmerate all edges in this edge loop.\n \n The mesh the edges belong too.\n The next edge\n \n \n \n Enmerate all vertices in this edge loop.\n \n The mesh the edges belong too.\n The next vertex\n \n \n \n https://github.com/caosdoar/spheres/blob/master/src/spheres.cpp\n https://github.com/mrdoob/three.js/tree/dev/src/geometries\n \n \n \n \n Is the edge a border to a hole.\n \n \n \n \n The edges index.\n \n \n \n \n The edges source vertices index.\n \n \n \n \n The edges target vertices index.\n \n \n \n \n The edges opposite edge.\n \n \n \n \n The edges next edge.\n \n \n \n \n The edges previous edge.\n \n \n \n \n The edges face\n \n \n \n \n A edge where everthing is set to null index.\n \n \n \n \n Get the source point. \n \n The mesh the point belongs to.\n The source point\n If point is null index.\n \n \n \n Get the target point. \n \n The mesh the point belongs to.\n The target point\n If point is null index.\n \n \n \n \n \n \n \n \n \n Are these edges equal.\n \n \n \n \n \n \n \n Are these edges not equal.\n \n \n \n \n \n \n \n Are these objects equal.\n \n \n \n \n \n \n Are these edges equal.\n \n \n \n \n \n \n The edges hahe code\n \n \n \n \n \n Enmerate all edges in this edge loop.\n \n The mesh the edges belong too.\n The next edge\n \n \n \n Enmerate all vertices in this edge loop.\n \n The mesh the edges belong too.\n The next vertex\n \n \n \n The vertices point.\n \n \n \n \n The vertices degree is how mang edges connect to it.\n \n \n \n \n The vertices index.\n \n \n \n \n The vertices edge\n \n \n \n \n A vertex where all components are null.\n \n \n \n \n \n \n \n \n \n \n Are these vertices equal.\n \n \n \n \n \n \n \n Are these vertices not equal.\n \n \n \n \n \n \n \n Are these objects equal.\n \n \n \n \n \n \n Are these vertices equal.\n \n \n \n \n \n \n The vertices hash code\n \n \n \n \n \n Enmerate all edges surrounding the vertex.\n \n The mesh the edges belong too.\n The next edge\n \n \n \n Generic nef polyhedron definition.\n A 3D Nef polyhedron is a subset of the 3-dimensional space that is the result of forming\n complements and intersections starting from a finite set H of 3-dimensional halfspaces.\n Nef polyhedra are closed under all binary set operations, i.e., intersection, union, \n difference, complement, and under the topological operations boundary, closure, and interior.\n \n The kernel type.\n \n \n \n creates a Nef polyhedron and initializes it to the empty \n set if plane == EMPTY and to the whole space if space == COMPLETE.\n \n The nef's space\n \n \n \n creates a Nef polyhedron containing the halfspace on the \n negative side of plane including plane if boundary==INCLUDED, \n excluding plane if boundary==EXCLUDED.\n \n The plane.\n The boundary.\n \n \n \n creates a Nef polyhedron, which represents the same point \n set as the polyhedral surface.\n \n The polyhedron\n \n \n \n Create from a pointer.\n \n The polyhedrons pointer.\n \n \n \n The nef polyhdron as a string.\n \n The nef polyhedron as a string.\n \n \n \n Return the intersection of nef and nef1.\n \n \n \n \n \n \n Return the union of nef and nef1.\n \n \n \n \n \n \n Return the difference between nef and nef1.\n \n \n \n \n \n \n Return the symmetric difference of nef and nef1.\n \n \n \n \n \n \n Returns the complement of nef. \n \n \n \n \n \n Returns the interior of nef. \n \n \n \n \n \n Returns the boundary of nef. \n \n \n \n \n \n Returns the closure of nef.\n \n \n \n \n \n Returns the regularization, i.e. the closure of the interior, of nef.\n \n \n \n \n \n Returns the MinkowskiSum.\n \n \n \n \n \n Converts nef into a Polyhedron.\n nef must be simple to convert.\n \n The result of the conversion.\n True if nef is simple and the conversion was successful.\n \n \n \n Converts nef into a surface mesh.\n nef must be simple to convert.\n \n The result of the conversion.\n True if nef is simple and the conversion was successful.\n \n \n \n Get a list of the nef volumes.\n \n Get a list of the nef volumes.\n \n \n \n The abstract nef polyhedra definition.\n \n \n \n \n Default constructor.\n \n \n \n \n creates a Nef polyhedron and initializes it to the empty \n set if plane == EMPTY and to the whole space if space == COMPLETE.\n \n The polyhedron kernel.\n The nef's space\n \n \n \n creates a Nef polyhedron containing the halfspace on the \n negative side of plane including plane if boundary==INCLUDED, \n excluding plane if boundary==EXCLUDED.\n \n The polyhedron kernel.\n The plane.\n The boundary.\n \n \n \n creates a Nef polyhedron, which represents the same point \n set as the polyhedral surface.\n \n The polyhedron kernel.\n The polyhedron\n \n \n \n Construct with a new kernel.\n \n The polyhedron kernel.\n The polyhedrons pointer.\n \n \n \n The polyhedron kernel.\n Contains the functions to the unmanaged CGAL polhedron.\n \n \n \n \n \n \n \n \n \n Return the number of halfedge pairs.\n \n \n \n \n Return the number of halfedges.\n \n \n \n \n Return the number of faces.\n \n \n \n \n Return the number of vertices.\n \n \n \n \n Return the number of volumes.\n \n \n \n \n Returns true, if nef is the empty point set.\n \n \n \n \n Rreturns true, if nef is a 2-manifold.\n \n \n \n \n Returns true, if nef is the complete 3D space.\n \n \n \n \n Make nef the empty set if space == EMPTY and the complete \n 3D space if space == COMPLETE.\n \n \n \n \n Checks the integrity of nef.\n \n \n \n \n \n Decompose the nef into convex volumes.\n \n \n \n \n Print the nef polyhedron into a string builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Should the input polygon be checked.\n Can disable for better performance if \n it is know all input if valid.\n \n \n \n \n Check if the mesh is valid.\n \n The mesh to check.\n \n \n \n Check if the mesh is valid.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid closed mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid closed mesh.\n \n The polygon to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n Check if the mesh is a valid triangle mesh.\n \n The mesh to check.\n \n \n \n A polyhedral surface consists of vertices, edges, \n facets and an incidence relation on them.\n Each edge is represented by two halfedges with opposite orientations.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Construct from points and triangle indices.\n \n \n \n \n Construct from points and polygon indices.\n \n \n \n \n Create from a pointer.\n \n The meshs pointer.\n \n \n \n The polyhdron as a string.\n \n The mesh as a string.\n \n \n \n Create a deep copy of the mesh.\n \n A deep copy of the mesh.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Split the mesh into its unconnected components.\n \n Each unconnect component as a new mesh.\n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces polygon.\n Should the y coord of the points be used for the z coord.\n Thrown if the polygon is not simple.\n \n \n \n Create the dual mesh where each face becomes a vertex\n and each vertex becomes a face.\n Must be a valid closed mesh to create the dual.\n \n The duel mesh.\n Is thrown if the mesh is not a valid closed mesh.\n \n \n \n Convert to a surface mesh.\n \n The surface mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n The abstract polyhedra definition.\n \n \n \n \n Cached values found by running Update.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The mesh kernel.\n \n \n \n Construct with a new kernel.\n \n The mesh kernel.\n The meshs pointer.\n \n \n \n The mesh kernel.\n Contains the functions to the unmanaged CGAL polhedron.\n \n \n \n \n Number of vertices.\n \n \n \n \n Number of faces.\n \n \n \n \n Number of half edges.\n \n \n \n \n Number of border edges.\n Since each border edge of a polyhedral surface has exactly one \n border halfedge, this number is equal to size of border halfedges.\n \n \n \n \n Number of border halfedges.\n \n \n \n \n The current build stamp.\n \n \n \n \n Returns true if the polyhedral surface is combinatorially consistent.\n Must be a valid mesh to check many other properties.\n \n \n \n \n Returns true if there are no border edges.\n \n \n \n \n Returns true if all faces are triangles.\n \n \n \n \n Returns true if all faces are quads.\n \n \n \n \n Is the mesh a valid triangle mesh.\n \n \n \n \n Is the mesh a valid closed mesh.\n \n \n \n \n Is the mesh a valid closed triangle mesh.\n \n \n \n \n Has the update function been called.\n \n \n \n \n Mark th mesh as needing to be updated.\n \n \n \n \n Clear the mesh.\n \n \n \n \n Clear the index maps.\n The index maps are used to access the meshes elemnts by index.\n They are automaticaly created when a elements is accessed\n be a function requiring it.\n \n True to clear the vertex index map.\n True to clear the face index map.\n True to clear the edges index map.\n \n \n \n Clear the normal maps.\n \n True to clear the vertex normal map.\n True to clear the face normal map\n \n \n \n Builds the vertex and/or face index maps if needed.\n \n True to build the vertex index map.\n True to build the face index map.\n True to build the face index map.\n True to force the build even if already built.\n \n \n \n A tetrahedron is added to the polyhedral surface\n with its vertices initialized to p1, p2, p3, and p4.\n \n \n \n \n \n A edge in the tetrahdron.\n \n \n \n A triangle with border edges is added to the \n polyhedral surface with its vertices initialized to p1, p2, and p3.\n \n \n \n \n A edge in the triangle.\n \n \n \n Create a mesh from the points and indices.\n \n The meshes points.\n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Create a triangle mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a quad mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a mesh with quads and triangles.\n \n The meshes points.\n The point array length.\n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Create a mesh with riangles, quads, pentagons and hexagons.\n \n The meshs points.\n The length of the point array.\n The faces indices.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces points\n The point array length.\n Should the y coord of the points be used for the z coord.\n \n \n \n Get the triangle and quad indices.\n \n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Get the meshes triangles.\n \n The meshes triangles.\n The triangle array length.\n \n \n \n Get the meshes quads.\n \n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles and quads.\n \n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles, quads, pentagons and hexagons.\n \n The indices.\n \n \n \n Get the dual meshes triangles, quads, pentagons and hexagons.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The indices\n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n The points index.\n The vertices point.\n \n \n \n Get the vertices point.\n \n The vertex index in the mesh.\n The vertices point.\n If index is out of range.\n \n \n \n Get the point at the index\n and wrap around the polygon.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polygons last point.\n \n The points index.\n The point at the index.\n \n \n \n Get the vertices point but wraps the index.\n \n The vertex index in the mesh.\n The vertices point.\n \n \n \n Get the points in the mesh.\n \n The array to copy points into.\n The point array length.\n \n \n \n Set the point at the index.\n \n The points index\n The pointsam>\n If index is out of range.\n \n \n \n Set the points from a array.\n \n The point array.\n The point arrays length.\n \n \n \n Get a halfedges segment.\n \n The halfedges index.\n The segment.\n True if halfedge found.\n \n \n \n Get the segment.\n \n The segment index.\n The segment\n If segmentwith the index not found.\n \n \n \n Get a segment for each halfedge in the mesh.\n \n The segment array.\n The segment array length.\n \n \n \n Get the faces triangle. \n Presumes face is a triangle with no checks.\n \n The faces index.\n The faces triangle\n \n \n \n \n Get the triangle.\n \n The triangle index.\n The triangle\n If triangle with the index not found.\n \n \n \n Get a triangle for each face in the mesh.\n Presumes all faces are triangles with no checks.\n \n The trainagle array.\n The traingle arrays length.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the mesh vertex.\n \n The vertexs index.\n The vertexs\n If vertex with the index not found.\n \n \n \n Get the vertices in the mesh.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n True if the face was found.\n \n \n \n Get the mesh face.\n \n The faces index.\n The faces\n If face with the index not found.\n \n \n \n Get the faces in the mesh.\n \n The face array.\n The face array length.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n The halfedge.\n True if the halfedge was found.\n \n \n \n Get the mesh Halfedge.\n \n The Halfedges index.\n The Halfedges\n If Halfedge with the index not found.\n \n \n \n Get the halfedges in the mesh.\n \n The halfedge array.\n The halfedge array length.\n \n \n \n Count the number of triangles, quads and polygons in the mesh.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Count the number of triangles, quads and polygons in the dual mesh.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Get a centroid (the avergae face position) for each face in the mesh.\n \n The point array.\n The points arrays lemgth.\n \n \n \n Computes the vertex normals if needed.\n \n \n \n \n Computes the face normals if needed.\n \n \n \n \n Get the vertex normals.\n \n The normals array.\n The normals array length.\n \n \n \n Get the face normals.\n \n The normals array.\n The normals array length.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Make all faces triangles.\n \n \n \n \n sorts halfedges such that the non-border edges precede the border edges.\n For each border edge the halfedge iterator will reference the halfedge \n incident to the facet right before the halfedge incident to the hole.\n \n \n \n \n returns true if the border halfedges are in normalized representation, \n which is when enumerating all halfedges with the iterator: \n The non-border edges precede the border edges and for border edges,\n the second halfedge is the border halfedge.\n \n \n \n \n \n Find what side of the mesh the lies in.\n \n The point to check.\n ON_BOUNDED_SIDE if point inside mesh, \n ON_UNBOUNDED_SIDE if point not inside, \n ON_BOUNDARY if point is on the surface.\n \n \n \n Does the mesh contain the point.\n \n The point.\n If point is on the boundary does it count a being contained.\n True if the poly contains the point\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n Locate the face hit by the ray.\n \n The ray.\n The hit face.\n True if the ray hit a face.\n \n \n \n Locate the vertex hit by the ray.\n \n The ray.\n The distance the vertex has to be within hit point.\n The hit vertex.\n True if the ray hit a vertex.\n \n \n \n Locate the edge hit by the ray.\n \n The ray.\n The distance the edge has to be within hit point.\n The hit edge.\n True if the ray hit a edge.\n \n \n \n Tests if a set of faces of a triangulated surface mesh self-intersects.\n Must be a triangle mesh.\n \n True/Fasle if a valid triangle polyhedra,or UNDETERMINED if not.\n \n \n \n returns true if the polyhedral surface is combinatorially consistent.\n For level == 1 the normalization of the border edges is checked too.\n This method checks that each face is at least a triangle and that the\n two incident facets of a non-border edge are distinct.\n \n \n \n \n \n Computes the bounding box.\n \n The bounding box.\n \n \n \n Computes the area of a range of faces\n of a given triangulated surface mesh.\n \n The area or 0 if poyhedron is not valid triangle mesh.\n \n \n \n computes the centroid of a volume bounded \n by a closed triangulated surface mesh.\n \n The centroid or 0 if poyhedron is not valid.\n \n \n \n Computes the volume of the domain bounded by a \n closed triangulated surface mesh.\n \n The volume or 0 if poyhedron is not valid closed triangle mesh.\n \n \n \n Returns true if there are no border edges.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all vertices have exactly two incident edges.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all vertices have exactly three incident edges.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all faces are triangles.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Returns true if all faces are quads.\n \n True/Fasle if valid, or UNDETERMINED if not a valid polyhedra.\n \n \n \n Indicates if the mesh bounds a volume.\n Must be a closed and triangulated.\n \n True/Fasle if a valid triangle closed polyhedra,or UNDETERMINED if not.\n \n \n \n Builds the aabb tree used for location.\n Tree will be automatically built if need so not \n actually necessary to call this function.\n \n \n \n \n Will delete the aabb tree.\n \n \n \n \n Returns true if there exists a face of this poly and \n a face of other poly which intersect, and false otherwise.\n Must be a triangle mesh\n \n The other triangle poly.\n If test_bounded_sides is set to true, \n the overlap of bounded sides are tested as well. In that case, the meshes must be closed.\n True/Fasle if a valid triangle closed polyhedra,or UNDETERMINED if not.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Read data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Write data from a off file into the pollyhedron.\n \n The files name.\n \n \n \n Return all the points in the mesh in a array.\n \n The array.\n \n \n \n Return all the points in the mesh in a list.\n \n The list.\n \n \n \n https://doc.cgal.org/latest/Polyhedron/classCGAL_1_1Polyhedron__3.html#a73119c0c90bf8612da003305af25a52a\n creates a new facet within the hole incident to h and g by connecting the \n vertex denoted by g with the vertex denoted by h with a new halfedge and \n filling this separated part of the hole with a new facet, such that the \n new facet is incident to g.\n \n Precondition\n h->is_border(), g->is_border(), h != g, h->next() != g, \n and g can be reached along the same hole starting with h.\n \n a halfedge index\n a halfedge index\n Returns the halfedge of the new edge that is incident to the new facet.\n \n \n \n creates a new facet within the hole incident to h and g by connecting the \n tip of g with the tip of h with two new halfedges and a new vertex and \n filling this separated part of the hole with a new facet, such that the \n new facet is incident to g.\n \n Precondition\n h->is_border(), g->is_border(), h != g, and g can be reached along the same hole starting with h.\n \n a halfedge index\n a halfedge index\n Returns the halfedge of the new edge that is incident to the new facet and the new vertex.\n \n \n \n barycentric triangulation of h->facet().\n Creates a new vertex, a copy of h->vertex(), and connects it to each vertex incident \n to h->facet() splitting h->facet() into triangles.h remains incident to the original \n facet, all other triangles are copies of this facet.\n Precondition\n h is not a border halfedge.\n \n a halfedge index\n Returns the halfedge h->next() \n after the operation, i.e., a halfedge pointing to the new vertex.The time is \n proportional to the size of the facet.\n \n \n \n reverses create_center_vertex().\n Erases the vertex pointed to by g and all incident halfedges thereby merging all \n incident facets.Only g->facet() remains. The neighborhood of g->vertex() may not \n be triangulated, it can have larger facets.\n Precondition\n None of the incident facets of g->vertex() is a hole. There are at least two distinct facets incident to the facets that are incident to g->vertex(). (This prevents the operation from collapsing a volume into two facets glued together with opposite orientations, such as would happen with any vertex of a tetrahedron.)\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns the halfedge g->prev(). \n Thus, the invariant h == erase_center_vertex(create_center_vertex(h)) \n holds if h is not a border halfedge.The time is proportional to the sum of the size of all incident facets.\n \n \n \n removes the incident facet of h and changes all halfedges incident to the facet \n into border edges or removes them from the polyhedral surface if they were already border edges.\n If this creates isolated vertices they get removed as well.See make_hole(h) for a more specialized variant.\n Precondition\n h->is_border() == false.\n Supports_removal must be CGAL::Tag_true\n \n a halfedge index\n \n \n \n \n Erase a facet.\n \n a halfedge index\n returns a range of handles over the facets.\n \n \n \n fills a hole with a newly created facet.\n Makes all border halfedges of the hole denoted \n by h incident to the new facet.Returns h.\n Precondition\n h.is_border().\n \n a halfedge index\n \n \n \n \n performs an edge flip.\n \n Precondition\n h != Halfedge_handle() and both facets incident to h are triangles.\n \n a halfedge index\n It returns h after rotating the edge h one vertex in the direction of the face orientation.\n \n \n \n joins the two facets incident to h.\n The facet incident to h->opposite() gets removed.Both facets might be holes. \n \n Precondition\n The degree of both vertices incident to h is at least three(no antennas).\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns the predecessor of h around the facet. The invariant join_facet(split_facet(h, g)) \n returns h and keeps the polyhedron unchanged.The time is proportional to the size of \n the facet removed and the time to compute h->prev().\n \n \n \n glues the boundary of the two facets denoted by h and g together and returns h.\n Both facets and the vertices along the facet denoted by g gets removed.Both facets may be holes.\n The invariant join_loop(h, split_loop(h, i, j)) \n Precondition\n The facets denoted by h and g are different and have equal degree(i.e., number of edges).\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n a halfedge index\n returns h and keeps the polyhedron unchanged.\n \n \n \n joins the two vertices incident to h.\n The vertex denoted by h->opposite() gets removed.\n Precondition\n The size of both facets incident to h is at least four(no multi-edges).\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns the predecessor of h around the vertex, i.e.,\n h->opposite()->prev(). The invariant join_vertex(split_vertex(h, g)) \n returns h and keeps the polyhedron unchanged.The time is proportional \n to the degree of the vertex removed and the time to compute h->prev() and h->opposite()->prev().\n \n \n \n removes the incident facet of h and changes all halfedges incident to the facet into border edges.\n \n Precondition\n None of the incident halfedges of the facet is a border edge.\n Supports_removal must be CGAL::Tag_true.\n \n a halfedge index\n Returns h.See erase_facet(h) for a more generalized variant.\n \n \n \n splits the halfedge h into two halfedges inserting a new vertex that is a copy of h->opposite()->vertex().\n Is equivalent to split_vertex(h->prev(), h->opposite())->opposite(). The call of prev() can make this method \n slower than a direct call of split_vertex() if the previous halfedge is already known and computing \n it would be costly when the halfedge data structure does not support the prev() member function.\n \n \n a halfedge index\n Returns the new halfedge now pointing to the inserted vertex.The new halfedge is followed \n by the old halfedge, i.e., hnew->next() == h.\n \n \n \n splits the facet incident to h and g into two facets with a new diagonal between \n the two vertices denoted by h and g respectively.\n The second(new) facet is a copy of the first facet.\n Precondition\n h and g are incident to the same facet.h != g (no loops). h->next() != g and g->next() != h (no multi-edges).\n \n a halfedge index\n a halfedge index\n Returns h->next() after the\n operation, i.e., the new diagonal.The new face is to the right of the new diagonal,\n the old face is to the left.The time is proportional to the distance from h to g around the facet.\n \n \n \n \n cuts the polyhedron into two parts along the cycle (h,i,j) (edge j runs on the backside of the three dimensional figure above).\n Three new vertices(one copy for each vertex in the cycle) and three new halfedges(one copy for each halfedge in the cycle), \n and two new triangles are created.h,i,j will be incident to the first new triangle.\n Precondition\n h, i, j denote distinct, consecutive vertices of the polyhedron and form a cycle: i.e., h->vertex() == i->opposite()->vertex(),\n … , j->vertex() == h->opposite()->vertex(). The six facets incident to(h, i, j) are all distinct.\n \n a halfedge index\n a halfedge index\n a halfedge index\n The return value will be the halfedge \n incident to the second new triangle which is the copy of h-opposite().\n \n \n \n splits the vertex incident to h and g into two vertices, the old vertex remains and a\n new copy is created, and connects them with a new edge.\n Let hnew be h->next()->opposite() after the split, i.e., a halfedge of the new edge.\n The split regroups the halfedges around the two vertices.The halfedge sequence hnew,\n g->next()->opposite(), … , h remains around the old vertex, while the halfedge \n sequence hnew->opposite(), h->next()->opposite() (before the split), … , g is \n regrouped around the new vertex.\n Precondition\n h and g are incident to the same vertex. h != g (antennas are not allowed).\n \n a halfedge index\n a halfedge index\n The split returns hnew, i.e., the new halfedge \n incident to the old vertex.The time is proportional to the distance from h to \n g around the vertex.\n \n \n \n Update the mesh if needed.\n \n \n \n \n Print the mesh into a string builder.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n This class is a data structure that can be used as halfedge data structure.\n It is an alternative to the classes Polyhedron3.The main difference is that it is indexed based and not pointer based, \n and that the mechanism for adding information to vertices, halfedges, edges, and faces is much simpler.\n When elements are removed, they are only marked as removed, and a garbage collection function must be called to really remove them.\n \n The kernel type\n \n \n \n Default constructor.\n \n \n \n \n Construct from points and triangle indices.\n \n \n \n \n Construct from points and polygon indices.\n \n \n \n \n Create from a pointer.\n \n The surface meshes pointer.\n \n \n \n The mesh as a string.\n \n The mesh as a string.\n \n \n \n Create a deep copy of the mesh.\n \n The deep copy.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Split the mesh into its unconnected components.\n \n Each unconnect component as a new mesh.\n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Copy the other mesh to this one.\n \n \n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces polygon.\n Should the y coord of the points be used for the z coord.\n Thrown if the polygon is not simple.\n \n \n \n Convert to a polyhedron mesh.\n \n The polyhedron mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n The surface mesh abstract base class.\n \n \n \n \n Cached values found by running Update.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct mesh with the kernel.\n \n The kernel\n \n \n \n Construct with a new kernel.\n \n The surface meshes kernel.\n The surface meshes pointer.\n \n \n \n The meshes kernel type.\n \n \n \n \n The number of vertices in the mesh.\n \n \n \n \n The number of half edges in the mesh.\n \n \n \n \n The number of edges in the mesh.\n \n \n \n \n The number of faces in the mesh.\n \n \n \n \n The number of border edges.\n \n \n \n \n The current build stamp.\n \n \n \n \n The number of vertices currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of vertices marked to be removed.\n \n \n \n The number of halfedges currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of half edges marked to be removed.\n \n \n \n The number of edges currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of edges marked to be removed.\n \n \n \n The number of faces currenly maked to be removed\n but have not. Calling collect garbage will remove them.\n \n The number of face marked to be removed.\n \n \n \n Returns true if the meshl surface is combinatorially consistent.\n Must be a valid mesh to check many other properties.\n \n \n \n \n Returns true if there are no border edges.\n \n \n \n \n Returns true if all faces are triangles.\n \n \n \n \n Returns true if all faces are quads.\n \n \n \n \n Is the mesh a valid triangle mesh.\n \n \n \n \n Is the mesh a valid closed mesh.\n \n \n \n \n Is the mesh a valid closed triangle mesh.\n \n \n \n \n Has the update function been called.\n \n \n \n \n Mark the mesh as needing to be updated.\n \n \n \n \n Clear the mesh.\n \n \n \n \n Clear the index maps.\n The index maps are used to access the meshes elemnts by index.\n They are automaticaly created when a elements is accessed\n be a function requiring it.\n \n True to clear the vertex index map.\n True to clear the face index map.\n True to clear the edges index map.\n True to clear the halfedges index map.\n \n \n \n Clear the normal maps.\n \n True to clear the vertex normal map.\n True to clear the face normal map\n \n \n \n Clear the property maps.\n \n \n \n \n Build the index maps.\n The index maps are used to access the meshes elemnts by index.\n They are automaticaly created when a elements is accessed\n be a function requiring it but can be create ahead of time.\n \n True to build the vertex index maps.\n True to build the face index maps.\n True to build the edge index maps.\n True to build the halfedge index maps.\n The index maps wont be build if the mesh knows they are already built and upto date.\n Setting force to true will build them always.\n \n \n \n \n \n \n \n \n \n \n \n \n \n Adds a vertex to the mesh.\n \n The vertices position\n The vertices index in the mesh.\n \n \n \n Adds a edge between the two vertices.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the edge in the mesh.\n \n \n \n Adds a triangle face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Adds a quad face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Adds a pentagon face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Adds a hexagon face to the mesh.\n \n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the vertex in the mesh.\n The index of the face in the mesh.\n \n \n \n Add a polygon face to the mesh.\n \n The indices of the points in the mesm.\n The indices array length.\n The index of the face in the mesh.\n \n \n \n Checks if any vertices, halfedges, edges, or faces are marked as removed.\n \n \n \n \n \n Really removes vertices, halfedges, edges, and faces which are marked removed.\n By garbage collecting elements get new indices. In case you store indices in an \n auxiliary data structure or in a property these indices are potentially no \n longer refering to the right elements.\n \n \n \n \n Controls the recycling or not of simplices previously marked as removed \n upon addition of new elements.\n When set to true (default value), new elements are first picked in the \n garbage(if any) while if set to false only new elements are created.\n \n \n \n \n \n Array accessor for the polygon.\n Getting a point wraps around the polygon.\n \n \n \n \n \n \n Get the vertices point.\n \n The vertex index in the mesh.\n The vertices point.\n If index is out of range.\n \n \n \n Get the points in the mesh.\n \n The array to copy points into.\n The point array length.\n \n \n \n Set the point at the index.\n \n The points index\n The pointsam>\n If index is out of range.\n \n \n \n Set the points from a array.\n \n The point array.\n The point arrays length.\n \n \n \n Get a halfedges segment.\n \n The halfedges index.\n The segment.\n True if halfedge found.\n \n \n \n Get a segment for each halfedge in the mesh.\n \n The segment array.\n The segment array length.\n \n \n \n Get the faces triangle. \n Presumes face is a triangle with no checks.\n \n The faces index.\n The faces triangle\n \n \n \n \n Get a triangle for each face in the mesh.\n Presumes all faces are triangles with no checks.\n \n The trainagle array.\n The traingle arrays length.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the mesh vertex.\n \n The vertices index.\n The vertex.\n \n \n \n Get the vertices in the mesh.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n True if the face was found.\n \n \n \n Get the mesh face.\n \n The faces index.\n The face.\n \n \n \n Get the faces in the mesh.\n \n The face array.\n The face array length.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n The halfedge.\n True if the halfedge was found.\n \n \n \n Get the mesh halfedge.\n \n The halfedges index.\n THe healfedge.\n \n \n \n Get the halfedges in the mesh.\n \n The halfedge array.\n The halfedge array length.\n \n \n \n Returns the number of incident halfedges of vertex.\n \n The index of the vertex in the mesh.\n Returns the number of incident halfedges of vertex.\n \n \n \n Returns the number of incident halfedges of face.\n \n The index of the face in the mesh.\n Returns the number of incident halfedges of face.\n \n \n \n Returns whether vertex is isolated.\n \n The index of the vertex in the mesh.\n Returns whether vertex is isolated.\n \n \n \n Returns whether vertex is a border vertex.\n If the data contained in the Surface_mesh is not\n a 2-manifold, then this operation is not \n guaranteed to return the right result.\n \n he index of the vertex in the mesh.\n With the default value for \n check_all_incident_halfedges the function iteratates over the incident \n halfedges. With check_all_incident_halfedges == false the function \n returns true, if the incident halfedge associated to vertex is a\n border halfedge, or if the vertex is isolated.\n Returns whether vertex is a border vertex.\n \n \n \n Returns whether edge is a border edge, i.e., if any of its two halfedges is a border halfedge.\n \n The index of the edge in the mesh.\n Returns whether edge is a border edge.\n \n \n \n Returns the next halfedge within the incident face.\n \n The index of the halfedge in the mesh.\n Returns the next halfedge within the incident face.\n \n \n \n Returns the previous halfedge within the incident face.\n \n The index of the halfedge in the mesh.\n Returns the previous halfedge within the incident face.\n \n \n \n Returns the opposite halfedge of halfedge.\n \n The index of the halfedge in the mesh.\n Returns the opposite halfedge of halfedge.\n \n \n \n Returns the vertex the halfedge emanates from.\n \n The index of the halfedge in the mesh.\n Returns the vertex the halfedge emanates from.\n \n \n \n Returns the vertex the halfedge points to.\n \n The index of the halfedge in the mesh.\n Returns the vertex the halfedge points to.\n \n \n \n Removes vertex from the halfedge data structure without adjusting anything.\n \n The index of the vertex in the mesh.\n True if face removed.\n \n \n \n Removes the two halfedges corresponding to edge from the halfedge\n data structure without adjusting anything.\n \n The index of the edge in the mesh.\n True if face removed.\n \n \n \n Removes face from the halfedge data structure without adjusting anything.\n \n The index of the face in the mesh.\n True if face removed.\n \n \n \n Has this vertex been marked to be removed.\n \n The vertices index in the mesh.\n Has this vertex been marked to be removed.\n \n \n \n Has this face been marked to be removed.\n \n The faces index in the mesh.\n Has this face been marked to be removed.\n \n \n \n Has this halfedge been marked to be removed.\n \n The halfedge index in the mesh.\n Has this halfedge been marked to be removed.\n \n \n \n Has this edge been marked to be removed.\n \n The edges index in the mesh.\n Has this edge been marked to be removed.\n \n \n \n Performs a validity check on a single vertex.\n \n The index of the vertex in the mesh.\n True if valid.\n \n \n \n Performs a validity check on a single edge.\n \n The index of the edge in the mesh.\n True if valid.\n \n \n \n Performs a validity check on a single halfedge.\n \n The index of the halfedge in the mesh.\n True if valid.\n \n \n \n Performs a validity check on a single face.\n \n The index of the face in the mesh.\n True if valid.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Create a mesh from the points and indices.\n \n The meshes points.\n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Create a triangle mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a quad mesh from the points and indices.\n \n The meshes points.\n The point arrays length.\n The meshes trinagles as a index array.\n The indices array length.\n \n \n \n Create a mesh with quads and triangles.\n \n The meshes points.\n The point array length.\n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Create a mesh with riangles, quads, pentagons and hexagons.\n \n The meshs points.\n The length of the point array.\n The faces indices.\n \n \n \n Create a mesh consisting of one polygon face.\n \n The faces points\n The paoint array length.\n Should the y coord of the points be used for the z coord.\n \n \n \n Get the triangle and quad indices.\n \n The meshes triangles as a index array. Maybe null.\n The meshes quads as a index array. Maybe null.\n \n \n \n Get the meshes triangles.\n \n The meshes triangles.\n The triangle array length.\n \n \n \n Get the meshes quads.\n \n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles and quads.\n \n The meshes triangles.\n The triangle array length.\n The meshes quads.\n The quads array length.\n \n \n \n Get the meshes triangles, quads, pentagons and hexagons.\n \n The indices.\n \n \n \n Whether v is a border vertex.\n \n The vertices index.\n With the default value for \n check_all_incident_halfedges the function iteratates over the incident halfedges. \n With check_all_incident_halfedges == false the function returns true, \n if the incident halfedge associated to vertex v is a border halfedge, \n or if the vertex is isolated.\n Whether v is a border vertex.\n \n \n \n Whether half edge is a border halfege, that is if its incident face is null.\n \n The halfedges index.\n Whether half edge is a border halfege.\n \n \n \n Whether e is a border edge, i.e., if any of its two halfedges is a border halfedge.\n \n The edges index.\n Whether e is a border edge.\n \n \n \n Count the number of triangles, quads and polygons in the mesh.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Count the number of triangles, quads and polygons in the dual mesh.\n A dual mesh is were faces become vertices and vertices become faces.\n \n The number of triangles, quads and polygons in the mesh.\n \n \n \n Build the aabb tree.\n \n \n \n \n Release the aabb tree.\n \n \n \n \n Find the bounding box of the meshes points.\n \n \n \n \n \n Read the mesh from a off file format.\n \n The files name.\n \n \n \n Write the mesh to off file format.\n \n The files name.\n \n \n \n Make all faces triangles.\n \n \n \n \n Tests if a set of faces of a triangulated surface mesh self-intersects.\n Must be a triangle mesh.\n \n True/Fasle if a valid triangle mesh,or UNDETERMINED if not.\n \n \n \n Perform an expensive validity check on the data structure.\n \n If the mesh is valid.\n \n \n \n Find if all the faces in the mesh are triangles.\n \n True if all the faces in the mesh are triangles, Will be undetermined if no a valid mesh.\n \n \n \n Find if all the faces in the mesh are quads.\n \n True if all the faces in the mesh are quads, Will be undetermined if no a valid mesh.\n \n \n \n Find if the mesh is closed, ie has no border edges.\n \n \n \n \n Computes the area of a range of faces\n of a given triangulated surface mesh.\n \n The area or 0 if mesh is not valid triangle mesh.\n \n \n \n computes the centroid of a volume bounded \n by a closed triangulated surface mesh.\n \n The centroid or 0 if mesh is not valid.\n \n \n \n Computes the volume of the domain bounded by a \n closed triangulated surface mesh.\n \n The volume or 0 if mesh is not valid closed triangle mesh.\n \n \n \n Indicates if the mesh bounds a volume.\n Must be a closed and triangulated.\n \n True/Fasle if a valid triangle closed mesh,or UNDETERMINED if not.\n \n \n \n Find what side of the mesh the lies in.\n \n The point to check.\n ON_BOUNDED_SIDE if point inside mesh, \n ON_UNBOUNDED_SIDE if point not inside, \n ON_BOUNDARY if point is on the surface.\n \n \n \n Does the mesh contain the point.\n \n The point.\n If point is on the boundary does it count a being contained.\n True if the poly contains the point\n \n \n \n Locate the face the rays hits.\n \n The ray.\n The hit result.\n \n \n \n Find the face closest to the point.\n \n The point.\n The hit result.\n \n \n \n Locate the face hit by the ray.\n \n The ray.\n The hit face.\n True if the ray hit a face.\n \n \n \n Locate the vertex hit by the ray.\n \n The ray.\n The distance the vertex has to be within hit point.\n The hit vertex.\n True if the ray hit a vertex.\n \n \n \n Locate the edge hit by the ray.\n \n The ray.\n The distance the edge has to be within hit point.\n The hit edge.\n True if the ray hit a edge.\n \n \n \n Returns true if there exists a face of this poly and \n a face of other mesh which intersect, and false otherwise.\n Must be a triangle mesh\n \n The other triangle poly.\n If test_bounded_sides is set to true, \n the overlap of bounded sides are tested as well. In that case, the meshes must be closed.\n True/Fasle if a valid triangle closed mesh,or UNDETERMINED if not.\n \n \n \n Find the min, max and average edge lengths in the mesh\n \n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh\n \n The min, max and average face areas in the mesh.\n \n \n \n Subdive the mesh.\n \n The number of iterations to perfrom.\n The subdivision method.\n \n \n \n Simplify the polyhedra.\n \n A number between 0-1 that represents the percentage of vertices to remove.\n \n \n \n Refines a triangle mesh\n \n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n \n \n \n Reverses the orientation of the vertices in each face.\n \n \n \n \n Remove all unconnected compontents except the largest.\n Largest is defined by the face count.\n \n The numbero of largest components to keep.\n The number of components removed in the mesh.\n \n \n \n Get a centroid (the avergae face position) for each face in the mesh.\n \n The point array.\n The points arrays lemgth.\n \n \n \n Compute the vertex normal map.\n Will only be computed if mesh has\n changed since last computation or \n no current nomral maps have been computed.\n \n \n \n \n Compute the face normal map.\n Will only be computed if mesh has\n changed since last computation or \n no current nomral maps have been computed.\n \n \n \n \n Get the vertex normals.\n Will be compute if they have not aready.\n \n The normal map array.\n The normal maps array length.\n \n \n \n Get the face normals.\n Will be compute if they have not aready.\n \n The normal map array.\n The normal maps array length.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Enumerate all points in the mesh.\n \n Each point in mesh.\n \n \n \n Return all the points in the mesh in a array.\n \n The array.\n \n \n \n Return all the points in the mesh in a list.\n \n The list.\n \n \n \n Update the mesh if needed.\n \n \n \n \n Print the mesh into a string builder.\n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Generic polyline definition.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Create from a set of points.\n \n The polylines points.\n \n \n \n Create from a pointer.\n \n The polylines pointer.\n \n \n \n The polyline as a string.\n \n The polyline as a string.\n \n \n \n Copy the polyline.\n \n The copied polyline.\n \n \n \n Create a polygon from the line.\n \n Threshold for the firat and last points being equal.\n The polygon.\n \n \n \n The abstract polyline definition.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The points to construct from.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The polylines pointer.\n \n \n \n The number of points in the polyline.\n \n \n \n \n The capacity of the point array.\n \n \n \n \n Get the first point.\n \n \n \n \n Get the last point.\n \n \n \n \n The polylines kernel.\n Contains the functions to the unmanaged CGAL polyline.\n \n \n \n \n Array accessor for the polyline.\n Getting a point clamps to the last point in polyline.\n \n \n \n \n \n \n Clear the polyline of all points.\n \n \n \n \n Shrink the capacity to match the point count.\n \n \n \n \n Resize the point array.\n New elements will default to zero.\n \n \n \n \n \n Reverse the polints in the line.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index\n \n \n \n Remove a range of points from the array.\n \n The starting index\n The number of points to remove.\n \n \n \n Remove the last point.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index.\n The point to insert.\n \n \n \n Remove a range of points from the array.\n \n The points to insert.\n The starting index.\n The number of points to insert.\n \n \n \n Add the point to the end of the poylline.\n \n The point to add.\n \n \n \n Does the first and last point match.\n \n The distance threshold that counts as match.\n \n \n \n \n Get the point a the index.\n \n The points index to get.\n The point at index.\n \n \n \n Get the point at the index\n and wrap around the polyline.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polylines last point.\n \n The points index.\n The point at the index.\n \n \n \n Get all the points in the polyline.\n \n The point array to copy the data into.\n The array length.\n \n \n \n Get all the polyline points.\n \n The list to copy the data into.\n \n \n \n Get all the polyline segments.\n \n The segment array to copy the data into.\n The array length.\n \n \n \n Set the points at the index.\n \n The points index.\n The points value.\n \n \n \n Set the points from the array.\n If the array is larger than the polyline then \n the new points will be appended to end of polyline.\n \n The points array.\n The array length.\n \n \n \n Finds the length of the polyline.\n \n \n \n \n \n Finds the square length of the polyline.\n \n \n \n \n \n Translate the polyline.\n \n The amount to translate.\n \n \n \n Rotate the polyline.\n \n The amount to rotate in radians.\n \n \n \n Scale the polyline.\n \n The amount to scale.\n \n \n \n Transform the polyline with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Return all the points in the polyline in a array.\n \n The array.\n \n \n \n Return all the points in the polyline in a list.\n \n The list.\n \n \n \n Convert the polyline to a new polyline with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polline.\n \n \n \n Print the polyline into a styring builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Generic polyline definition.\n \n The kernel type.\n \n \n \n Default constructor.\n \n \n \n \n Create from a set of points.\n \n The polylines points.\n \n \n \n Create from a pointer.\n \n The polylines pointer.\n \n \n \n The polyline as a string.\n \n The polyline as a string.\n \n \n \n Copy the polyline.\n \n The copied polyline.\n \n \n \n The abstract polyline definition.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The points to construct from.\n \n \n \n Construct with a new kernel.\n \n The polyline kernel.\n The polylines pointer.\n \n \n \n The number of points in the polyline.\n \n \n \n \n The capacity of the point array.\n \n \n \n \n Get the first point.\n \n \n \n \n Get the last point.\n \n \n \n \n The polylines kernel.\n Contains the functions to the unmanaged CGAL polyline.\n \n \n \n \n Array accessor for the polyline.\n Getting a point clamps to the last point in polyline.\n \n \n \n \n \n \n Clear the polyline of all points.\n \n \n \n \n Shrink the capacity to match the point count.\n \n \n \n \n Resize the point array.\n New elements will default to zero.\n \n \n \n \n \n Reverse the polints in the line.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index\n \n \n \n Remove a range of points from the array.\n \n The starting index\n The number of points to remove.\n \n \n \n Remove the last point.\n \n \n \n \n Remove the point at the index from the array.\n \n The points index.\n The point to insert.\n \n \n \n Remove a range of points from the array.\n \n The points to insert.\n The starting index.\n The number of points to insert.\n \n \n \n Add the point to the end of the poylline.\n \n The point to add.\n \n \n \n Does the first and last point match.\n \n The distance threshold that counts as match.\n \n \n \n \n Get the point a the index.\n \n The points index to get.\n The point at index.\n \n \n \n Get the point at the index\n and wrap around the polyline.\n \n The points index.\n The point at the index.\n \n \n \n Get the point at the index\n and clamp to the polylines last point.\n \n The points index.\n The point at the index.\n \n \n \n Get all the points in the polyline.\n \n The point array to copy the data into.\n The array length.\n \n \n \n Get all the polyline points.\n \n The list to copy the data into.\n \n \n \n Get all the polyline segments.\n \n The segment array to copy the data into.\n The array length.\n \n \n \n Set the points at the index.\n \n The points index.\n The points value.\n \n \n \n Set the points from the array.\n If the array is larger than the polyline then \n the new points will be appended to end of polyline.\n \n The points array.\n The array length.\n \n \n \n Finds the length of the polyline.\n \n \n \n \n \n Finds the square length of the polyline.\n \n \n \n \n \n Translate each point in the polyline.\n \n The amount to translate.\n \n \n \n Rotate each point in the polyline.\n \n The amount to rotate.\n \n \n \n Scale each point in the polyline.\n \n The amount to scale.\n \n \n \n Transform each point in the polyline.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Enumerate all points in the polyline.\n \n Each point in polyline.\n \n \n \n Return all the points in the polyline in a array.\n \n The array.\n \n \n \n Return all the points in the polyline in a list.\n \n The list.\n \n \n \n Convert the polyline to a new polyline with a different kernel.\n May result in different values due to precision issues.\n \n The new kernel type.\n The new polline.\n \n \n \n Print the polyline into a styring builder.\n \n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n Release the unmanaged pointer.\n \n \n \n \n The heat method is an algorithm that solves the single- or multiple-source shortest \n path problem by returning an approximation of the geodesic distance for all vertices\n of a triangle mesh to the closest vertex in a given set of source vertices. \n The geodesic distance between two vertices of a mesh is the distance when walking \n on the surface, potentially through the interior of faces. Two vertices that are \n close in 3D space may be far away on the surface.\n \n \n \n \n \n Create a static instance.\n \n \n \n \n Create a new instance.\n \n \n \n \n Create a new instance from a existing pointer to a unmanaged object.\n \n The unmanaged objects pointer.\n \n \n \n \n \n \n \n \n \n Find the distances for each vertex in the mesh to the vertex at the provided index.\n \n The mesh containing the vertices.\n The vertices index to find the distances to.\n The distances for each vertex in the mesh.\n Should the intrinsitic delaunay triangulation be used. \n This will improve the results for meshes that have bad triangle quality.\n The maximum distance value.\n \n \n \n Find the distances for each vertex in the mesh to the vertex at the provided index.\n \n The mesh containing the vertices.\n The vertices index to find the distances to.\n The distances for each vertex in the mesh.\n This will improve the results for meshes that have bad triangle quality.\n The maximum distance value.\n \n \n \n \n \n \n \n \n Create a new instance.\n \n \n \n \n \n Create a new instance from a existing pointer to a unmanaged object.\n \n \n The unmanaged objects pointer.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Returns the number of unconnect components in the mesh.\n \n A valid mesh.\n Returns the number of unconnect components in the mesh.\n \n \n \n Returns a list of face indices that are part of the same component as the provided face index.\n \n A valid mesh.\n The faces index in the mesh.\n A list of face indices that are part of the same component as the provided face index.\n \n \n \n Returns a list of face indices that are part of the same component as the provided face index.\n \n A valid mesh.\n The faces index in the mesh.\n A list of face indices that are part of the same component as the provided face index.\n \n \n \n Split each component in the mesh into individual meshes.\n \n A valid mesh.\n The split meshes.\n \n \n \n Split each component in the mesh into individual meshes.\n \n A valid mesh.\n The split meshes.\n \n \n \n Removes connected components with less than a given number of faces.\n \n A valid mesh.\n The number of faces a component must have so that it is kept\n The number of components removed.\n \n \n \n Removes connected components with less than a given number of faces.\n \n A valid mesh.\n The number of faces a component must have so that it is kept\n The number of components removed.\n \n \n \n Removes the small connected components and all isolated vertices.\n \n A valid mesh.\n Keep this number of the largest connected components.\n The number of components removed.\n \n \n \n Removes the small connected components and all isolated vertices.\n \n A valid mesh.\n Keep this number of the largest connected components.\n The number of components removed.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Detects the edges that are considered to be sharp with respect to the given angle bound.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The halfedge indices of the edges that count as sharp.\n \n \n \n Detects the edges that are considered to be sharp with respect to the given angle bound.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The halfedge indices of the edges that count as sharp.\n \n \n \n Find the min, max and average edge lengths in the mesh.\n \n A valid mesh.\n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average edge lengths in the mesh.\n \n A valid mesh.\n The min, max and average edge lengths in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh.\n \n A valid mesh.\n The min, max and average face areas in the mesh.\n \n \n \n Find the min, max and average face areas in the mesh.\n \n A valid mesh.\n The min, max and average face areas in the mesh.\n \n \n \n Detects the sharp edges of mesh according to angle as the DetectSharpEdges function does. \n The sharp edges are then used to define a segmentation of a mesh, that is done by computing \n a surface patch id for each face.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The halfedge indices of the edges that count as sharp.\n The face indices for each patch found.\n \n \n \n Detects the sharp edges of pmesh according to angle as the DetectSharpEdges function does. \n The sharp edges are then used to define a segmentation of a mesh, that is done by computing \n a surface patch id for each face.\n \n A valid mesh.\n Angle in deg gives the maximum angle between \n the two normal vectors of adjacent triangles. For an edge of the input polygon mesh, \n if the angle between the two normal vectors of its incident facets is bigger than \n the given bound, then the edge is marked as being a feature edge.\n The face indices for each patch found.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Find a random point on mesh surface.\n \n The mesh.\n A random point on mesh surface.\n \n \n \n Find a random point on mesh surface.\n \n The mesh.\n A random point on mesh surface.\n \n \n \n Find the face the ray intersects with.\n \n The mesh.\n Th ray.\n The hit result with theface index, hit point and the barycentric coords.\n \n \n \n Find the face the ray intersects with.\n \n The mesh.\n Th ray.\n The hit result with theface index, hit point and the barycentric coords.\n \n \n \n Find the closest face to the point.\n \n The mesh.\n Th point.\n The hit result with the face index, closest point and the barycentric coords.\n \n \n \n Find the closest face to the point.\n \n The mesh.\n Th point.\n The hit result with the face index, closest point and the barycentric coords.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Fills output with a closed mesh bounding the volume swept by input when translating its vertices by dir.\n The mesh is oriented so that the faces corresponding to input in output have the same orientation.\n \n The a valid closed mesh.\n The direction vector.\n The extuded mesh.\n \n \n \n Fills output with a closed mesh bounding the volume swept by input when translating its vertices by dir.\n The mesh is oriented so that the faces corresponding to input in output have the same orientation.\n \n The a valid closed mesh.\n The direction vector.\n The extuded mesh.\n \n \n \n Fairs a region on a triangle mesh based on a ring of k vertices from the index vertex.\n The points of the selected vertices are relocated to yield an as-smooth-as-possible surface patch,\n based on solving a linear bi-Laplacian system with boundary constraints\n The region described by vertices might contain multiple disconnected components.\n Note that the mesh connectivity is not altered in any way, only vertex locations get updated.\n Fairing might fail if fixed vertices, which are used as boundary conditions, \n do not suffice to solve constructed linear system.\n Note that if the vertex range to which fairing is applied contains all the vertices of the triangle mesh, \n fairing does not fail, but the mesh gets shrinked to the origin.\n \n A valid triangle mesh.\n The vertex index in the mesh to start hthe k ring region from.\n The number of vertics to expand the region to.\n If the fairing was successfully run.\n \n \n \n Refines a triangle mesh\n \n A valid triangle mesh.\n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices added.\n \n \n \n Refines a triangle mesh\n \n A valid triangle mesh.\n a factor to control density of the output mesh, \n where larger values lead to denser refinements. Defalus to sqrt of 2.\n The number of new vertices added.\n \n \n \n Remeshes a triangulated region of a meshgon mesh.\n This operation sequentially performs edge splits, edge collapses, edge flips, \n tangential relaxation and projection to the initial surface to generate \n a smooth mesh with a prescribed edge length.\n \n A valid triangle mesh.\n The number of times to perform the remeshing.\n the edge length that is targeted in the remeshed patch. \n If 0 is passed then only the edge-flip, tangential relaxation, and projection steps will be done.\n The number of new vertices added.\n \n \n \n Remeshes a triangulated region of a meshgon mesh.\n This operation sequentially performs edge splits, edge collapses, edge flips, \n tangential relaxation and projection to the initial surface to generate \n a smooth mesh with a prescribed edge length.\n \n A valid triangle mesh.\n The number of times to perform the remeshing.\n the edge length that is targeted in the remeshed patch. \n If 0 is passed then only the edge-flip, tangential relaxation, and projection steps will be done.\n The number of new vertices added.\n \n \n \n randomly perturbs the locations of vertices of a triangulated surface mesh.\n By default, the vertices are re-projected onto the input surface after \n perturbation.Note that no geometric checks are done after the perturbation \n (face orientation might become incorrect and self-intersections might be introduced).\n \n A mesh.\n The maximun amount a vertex will be pertured. Must be greater tha 0.\n \n \n \n randomly perturbs the locations of vertices of a triangulated surface mesh.\n By default, the vertices are re-projected onto the input surface after \n perturbation.Note that no geometric checks are done after the perturbation \n (face orientation might become incorrect and self-intersections might be introduced).\n \n A mesh.\n The maximun amount a vertex will be pertured. Must be greater tha 0.\n \n \n \n Smooths a triangulated mesh.\n This function attempts to make the triangle angle and area distributions as uniform \n as possible by moving(non-constrained) vertices.\n Angle-based smoothing does not change the combinatorial information of the mesh.\n Area-based smoothing might change the combinatorial information, unless specified otherwise.\n It is also possible to make the smoothing algorithm \"safer\" by rejecting moves that, \n when applied, would worsen the quality of the mesh, e.g.that would decrease the value\n of the smallest angle around a vertex or create self-intersections.\n Optionally, the points are reprojected after each iteration.\n \n A valid triangle mesh.\n The edge angle that counts a feature and wont be smoothed.\n The number of iterations for the sequence of the smoothing iterations performed\n \n \n \n splits the edges listed in edges into sub-edges that are not longer than the given threshold max_length.\n Note this function is useful to split constrained edges before calling isotropic_remeshing() with protection\n of constraints activated (to match the constrained edge length required by the remeshing algorithm to be guaranteed to terminate)\n \n A valid mesh.\n The edge length above which an edge from edges is split into to sub-edges\n The number of new edges added to the mesh.\n \n \n \n splits the edges listed in edges into sub-edges that are not longer than the given threshold max_length.\n Note this function is useful to split constrained edges before calling isotropic_remeshing() with protection\n of constraints activated (to match the constrained edge length required by the remeshing algorithm to be guaranteed to terminate)\n \n A valid mesh.\n The edge length above which an edge from edges is split into to sub-edges\n The number of new edges added to the mesh.\n \n \n \n Triangulate a single face in the mesh.\n \n A valid mesh.\n The faces index in the mesh.\n True if successful.\n \n \n \n Triangulate a single face in the mesh.\n \n A valid mesh.\n The faces index in the mesh.\n True if successful.\n \n \n \n Triangulate a range of faces in the mesh.\n \n A valid mesh.\n The faces to triangulate.\n The length of the face array.\n True if successful.\n \n \n \n Triangulate a range of faces in the mesh.\n \n A valid mesh.\n The faces to triangulate.\n The length of the face array.\n True if successful.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Indicates if mesh bounds a volume.\n \n A closed triangle mesh.\n \n \n \n Indicates if mesh bounds a volume.\n \n A closed triangle mesh.\n \n \n \n Tests whether a closed triangle mesh has a positive orientation.\n A closed triangle mesh is considered to have a positive orientation\n if the normal vectors to all its faces point outside the domain bounded \n by the triangle mesh.The normal vector to each face is chosen pointing\n on the side of the face where its sequence of vertices is seen counterclockwise.\n \n A closed triangle mesh.\n \n \n \n Tests whether a closed triangle mesh has a positive orientation.\n A closed triangle mesh is considered to have a positive orientation\n if the normal vectors to all its faces point outside the domain bounded \n by the triangle mesh.The normal vector to each face is chosen pointing\n on the side of the face where its sequence of vertices is seen counterclockwise.\n \n A closed triangle mesh.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n A valid closed triangle mesh.\n \n \n \n Orient the faces in the mesh.\n \n The orientation method.\n A valid closed triangle mesh.\n \n \n \n Makes each connected component of a closed triangulated surface mesh inward or outward oriented.\n \n A closed triangle mesh.\n \n \n \n Makes each connected component of a closed triangulated surface mesh inward or outward oriented.\n \n A closed triangle mesh.\n \n \n \n Orients the connected components of tm to make it bound a volume.\n \n A closed triangle mesh.\n \n \n \n Orients the connected components of tm to make it bound a volume.\n \n A closed triangle mesh.\n \n \n \n Reverses for each face the order of the vertices along the face boundary.\n \n A valid mesh.\n \n \n \n Reverses for each face the order of the vertices along the face boundary.\n \n A valid mesh.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Find the number of degenerate edges in the mesh.\n \n The polygon mesh.\n The number of degenerate edges in the mesh.\n \n \n \n Find the number of degenerate faces in the mesh.\n \n A triangle polygon mesh.\n The number of degenerate faces in the mesh.\n \n \n \n Find the number of degenerate faces in the mesh.\n \n A triangle polygon mesh.\n The number of degenerate faces in the mesh.\n \n \n \n Checks whether a triangle face is needle.\n A triangle is said to be a needle if its longest edge is much longer than its shortest edge.\n \n A triangle polygon mesh.\n A bound on the ratio of the longest edge length and the shortest edge length.\n The number of needle triangles.\n \n \n \n Checks whether a triangle face is needle.\n A triangle is said to be a needle if its longest edge is much longer than its shortest edge.\n \n A triangle polygon mesh.\n A bound on the ratio of the longest edge length and the shortest edge length.\n The number of needle triangles.\n \n \n \n Collects the non-manifold vertices (if any) present in the mesh.\n A non-manifold vertex v is returned via one incident halfedge h such that target(h, pm) = v \n for all the umbrellas that v appears in (an umbrella being the set of faces incident to all \n the halfedges reachable by walking around v using hnext = prev(opposite(h, pm), pm), starting from h).\n \n A triangle polygon mesh.\n The non manifold vertex count.\n \n \n \n Collects the non-manifold vertices (if any) present in the mesh.\n A non-manifold vertex v is returned via one incident halfedge h such that target(h, pm) = v \n for all the umbrellas that v appears in (an umbrella being the set of faces incident to all \n the halfedges reachable by walking around v using hnext = prev(opposite(h, pm), pm), starting from h).\n \n A triangle polygon mesh.\n The non manifold vertex count.\n \n \n \n Cleans a given polygon soup through various repairing operations.\n \n More precisely, this function carries out the following tasks, in the same order as they are listed:\n \n merging of duplicate points.\n simplification of polygons to remove geometrically identical consecutive vertices;\n splitting of \"pinched\" polygons, that is polygons in which a geometric position appears more than once.\n The splitting process results in multiple non-pinched polygons;\n removal of invalid polygons, that is polygons with fewer than 2 vertices;\n removal of duplicate polygons.\n removal of isolated points.\n \n The polygon mesh.\n \n \n \n Cleans a given polygon soup through various repairing operations.\n \n More precisely, this function carries out the following tasks, in the same order as they are listed:\n \n merging of duplicate points.\n simplification of polygons to remove geometrically identical consecutive vertices;\n splitting of \"pinched\" polygons, that is polygons in which a geometric position appears more than once.\n The splitting process results in multiple non-pinched polygons;\n removal of invalid polygons, that is polygons with fewer than 2 vertices;\n removal of duplicate polygons.\n removal of isolated points.\n \n The polygon mesh.\n \n \n \n stitches together, whenever possible, two halfedges belonging to the same boundary cycle.\n Two border halfedges h1 and h2 can be stitched if the points associated to the source and\n target vertices of h1 are the same as those of the target and source vertices of h2, respectively.\n \n The polygon mesh.\n The number of stiched boundaries.\n \n \n \n stitches together, whenever possible, two halfedges belonging to the same boundary cycle.\n Two border halfedges h1 and h2 can be stitched if the points associated to the source and\n target vertices of h1 are the same as those of the target and source vertices of h2, respectively.\n \n The polygon mesh.\n The number of stiched boundaries.\n \n \n \n Stitches together border halfedges in a polygon mesh.\n \n The polygon mesh.\n The number of stiched borders.\n \n \n \n Stitches together border halfedges in a polygon mesh.\n \n The polygon mesh.\n The number of stiched borders.\n \n \n \n Removes the isolated vertices from any polygon mesh.\n A vertex is considered isolated if it is not incident to any simplex of higher dimension.\n \n The polygon mesh.\n The number of vertices that were removed.\n \n \n \n Removes the isolated vertices from any polygon mesh.\n A vertex is considered isolated if it is not incident to any simplex of higher dimension.\n \n The polygon mesh.\n The number of vertices that were removed.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Find the line formed from the intersection of the plane and the mesh.\n \n The mesh. Is not modified.\n The plane.\n The polylines from the intersection.\n \n \n \n Find the line formed from the intersection of the plane and the mesh.\n \n The mesh. Is not modified.\n The plane.\n The polylines from the intersection.\n \n \n \n Find the lines formed by slicing the mesh from the start\n point to the end point creating a plane at each increment.\n \n The mesh. Is not modified.\n The point to start from.\n The point to end at.\n Amount to increment each plane.\n he polylines from the intersection.\n \n \n \n Find the lines formed by slicing the mesh from the start\n point to the end point creating a plane at each increment.\n \n The mesh. Is not modified.\n The point to start from.\n The point to end at.\n Amount to increment each plane.\n he polylines from the intersection.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Simplify the mesh.\n \n A valid triangle mesh.\n A percentage 0-1 of edges to remove.\n \n \n \n Simplify the mesh.\n \n A valid triangle mesh.\n A percentage 0-1 of edges to remove.\n \n \n \n Release the unmanaged resourses.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Subdive each face in the mesh.\n \n \n A valid mesh. Must be a triangle mesh for loop or sqrt3.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n \n A valid mesh. Must be a triangle mesh for loop or sqrt3.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n Subdive each face in the mesh.\n \n A valid triangle mesh.\n The number of subdivision iterations.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n Release the unmanaged resourses.\n \n \n \n \n Base triangulation class for Triangulation, DelaunayTriangulation,\n ConstrainedTriangulation and ConstrainedDelaunayTriangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulations kernel.\n \n \n \n \n The number of verices in the triangulation.\n \n \n \n \n The number of triangles in the triangulation.\n \n \n \n \n The number of indices need to represent the\n triangulation (number of triangles * 3).\n \n \n \n \n A number that will change if the unmanaged \n triangulation model changes.\n \n \n \n \n Clear the triangulation.\n \n \n \n \n Is this a valid triangulation.\n \n \n True if valid.\n \n \n \n Force the face and vertex indices to be set.\n \n \n \n \n Inserts point p in the triangulation.\n If point coincides with an already existing vertex the triangulation remains unchanged.\n If point is on an edge, the two incident faces are split in two.\n If point is strictly inside a face of the triangulation, the face is split in three.\n If point is strictly outside the convex hull, p is linked to all visible points on the \n convex hull to form the new triangulation.\n \n The point to insert.\n \n \n \n Inserts points into the triangulation.\n If point coincides with an already existing vertex the triangulation remains unchanged.\n If point is on an edge, the two incident faces are split in two.\n If point is strictly inside a face of the triangulation, the face is split in three.\n If point is strictly outside the convex hull, p is linked to all visible points on the \n convex hull to form the new triangulation.\n \n The points to insert.\n The ararys length.\n \n \n \n Get a array of all the points in the triangulation.\n \n The point array.\n The ararys length.\n \n \n \n Get a array of the triangle indices.\n \n \n The ararys length.\n \n \n \n Get the vertices point.\n \n The vertex index.\n The vertices point.\n True if the vertex was found.\n \n \n \n Get the point.\n \n The points index.\n The point\n If point with the index not found.\n \n \n \n Get a vertex.\n \n The vertex index.\n The vertex.\n True if the vertex was found.\n \n \n \n Get the vertex.\n \n The vertexs index.\n The vertexs\n If vertex with the index not found.\n \n \n \n Get a array of all the vertices.\n \n The vertex array.\n The ararys length.\n \n \n \n Get a triangule face.\n \n The faces index\n The face\n True if the face was found.\n \n \n \n Get the face.\n \n The faces index.\n The Faces\n If face with the index not found.\n \n \n \n Get a array of all the triangle faces.\n \n A array of faces.\n The ararys length.\n \n \n \n Get the segment between the face and a neighbour.\n \n The faces index\n The neighbour (0-2) index in the face.\n The segment.\n True if the face was found.\n \n \n \n Get the segment between the face and a neighbour.\n \n The faces index\n The neighbour (0-2) index in the face.\n The segment\n If segment with the index not found.\n \n \n \n Get a faces triangle.\n \n The faces index\n The triangle\n True if the face was found\n \n \n \n Get the triangle.\n \n The triangles index.\n The triangle\n If triangle with the index not found.\n \n \n \n Get a array of all the triangles.\n \n A array of triangules.\n The ararys length.\n \n \n \n Get a faces circumcenter.\n \n The faces index\n The circumcenter. A circle\n that passes through all three of the triangules vertices.\n True if the face was found.\n \n \n \n Get the circumcenter.\n \n The circumcenters index.\n The circumcenter\n If circumcenter with the index not found.\n \n \n \n Get a array of all the circumcenters.\n \n A array of circumcenters.\n The ararys length.\n \n \n \n Get the index of the faces neighbour.\n \n The faces index.\n The neighbour (0-2) index in the face.\n The index of the neighbour face in the triangulation. \n -1 if there is no neighbour face at this index.\n \n \n \n Locate the face the point hits.\n \n The point.\n The face the point has hit.\n True if the point hit a face.\n \n \n \n Locate the closest vertex to point.\n \n The point\n The distance the point must be within to count as hitting the vertex.\n The closest vertex.\n True if point hit a face and found a vertex.\n \n \n \n Locate the closest edge and segment to point.\n \n The point\n The distance the point must be within to count as hitting the edge.\n The closest edge.\n True if the point hit a face and found a edge.\n \n \n \n Remove the vertex.\n \n The vertices index.\n True if removed.\n \n \n \n Flip a edge between the face and a neighbour.\n \n The faces index\n The neighbour (0-2) index in the face.\n True if the edge was flipped.\n \n \n \n Translate the triangulation.\n \n The amount to translate.\n \n \n \n Rotate the triangulation.\n \n The amount to rotate in radians.\n \n \n \n Scale the triangulation.\n \n The amount to scale.\n \n \n \n Transform the triangulation with a TRS matrix.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n Base triangulation class for Triangulation, DelaunayTriangulation \n and ConstrainedTriangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulations kernel.\n \n \n \n \n Returns the buildStamp.\n The build stamp will change if \n the triangulation model has changed\n \n \n \n \n Returns the dimension of the affine hull.\n \n \n \n \n Returns the number of vertices.\n \n \n \n \n Returns the number of finite vertices.\n \n \n \n \n Returns the number of cells or 0 if Dimension less than 3.\n \n \n \n \n The number of finite cells.\n Returns 0 if Dimension less than 3.\n \n \n \n \n The number of edges.\n Returns 0 if Dimension less than 1.\n \n \n \n \n The number of finite edges.\n Returns 0 if Dimension less than 1.\n \n \n \n \n The number of facets.\n Returns 0 if Dimension less than 2.\n \n \n \n \n The number of facets.\n Returns 0 if Dimension less than 2.\n \n \n \n \n The number of indices needed for the finite tetrahedrons.\n \n \n \n \n Clear the triangulation.\n \n \n \n \n \n \n \n \n \n \n Inserts the point p in the triangulation.\n If point p coincides with an already existing vertex the triangulation remains unchanged.\n If point p lies in the convex hull of the points, it is added naturally: \n if it lies inside a cell, the cell is split into four cells, if it lies \n on a facet, the two incident cells are split into three cells, if it lies\n on an edge, all the cells incident to this edge are split into two cells.\n If point p is strictly outside the convex hull but in the affine hull, p \n is linked to all visible points on the convex hull to form the new triangulation.\n If point p is outside the affine hull of the points, p is linked to all the points,\n and the dimension of the triangulation is incremented. All the points now belong to \n the boundary of the convex hull, so, the infinite vertex is linked to all the points \n to triangulate the new infinite face.\n \n The point to insert\n \n \n \n Insert all the points in the array.\n \n The points to insert.\n The arrays length\n \n \n \n Insert a vertex into a cell.\n \n The cells index.\n The point to insert.\n \n \n \n If the point query lies inside the convex hull of the points, the cell that contains the query in its interior is returned.\n If query lies on a facet, an edge or on a vertex, one of the cells having query on its boundary is returned.\n If the point query lies outside the convex hull of the points, an infinite cell with vertices { p,q,r,∞} is\n returned such that the tetrahedron(p, q, r, query) is positively oriented(the rest of the triangulation lies\n on the other side of facet (p, q, r)).\n Note that locate works even in degenerate dimensions: in dimension 2 (resp. 1, 0) the Cell_handle returned\n is the one that represents the facet(resp.edge, vertex) containing the query point.\n The optional argument start is used as a starting place for the search.\n The optional argument could_lock_zone is used by the concurrency-safe version of the triangulation.When the\n pointer is not null, the locate will try to lock all the cells along the walk. If it succeeds,\n could_lock_zone is true, otherwise it is false. In any case, the locked cells are not unlocked by locate,\n leaving this choice to the user. \n \n The point to query\n The cell thats closest to point.\n The closest cell to point.\n \n \n \n Get the centroids of each cell.\n \n The array of points\n The array of points length\n \n \n \n Get all the points in the triangulation.\n \n The array to copy into.\n The arrays length.\n \n \n \n Get all the points in the triangulation.\n \n The array to copy into.\n \n \n \n Get the triangulation vertices.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get a triangulation vertex.\n \n The vertices index\n The vertex.\n \n \n \n \n Get the triangulation vertices.\n \n The vertex array.\n The vertex array length.\n \n \n \n Get a triangulation vertex.\n \n The vertices index\n The vertex.\n \n \n \n \n Get the indices of the cells edges in the triangulation.\n \n The indices array.\n The indices array length.\n \n \n \n Get the indices of the cells triangles in the triangulation.\n \n The indices array.\n The indices array length.\n \n \n \n Get the indices of the tetrahedron cells in the triangulation.\n \n The indices array.\n The indices array length.\n \n \n \n Translate each point in the mesh.\n \n The amount to translate.\n \n \n \n Rotate each point in the mesh.\n \n The amount to rotate.\n \n \n \n Scale each point in the mesh.\n \n The amount to scale.\n \n \n \n Transform each point in the mesh.\n \n The amount to translate.\n The amount to rotate.\n The amount to scale.\n \n \n \n \n \n \n \n \n \n Release any unmanaged resources.\n \n \n \n \n The generic constrained triangulation class.\n \n The kernel\n \n \n \n A static instance of the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as a string.\n \n \n \n \n \n A deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n The abstract triangulation class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the constrained triangulation.\n \n \n \n \n The number of constrainted edges in the triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n The moved vertex\n True if the vertex was found.\n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Get the number of constrainted edges incident to this vertex.\n \n The vertex index in the triagulation.\n The number of constrainted edges to the vertex.\n \n \n \n Does this vertex have a constrainted edge.\n \n The vertex index in the triagulation.\n Does this vertex have a constrainted edge.\n \n \n \n Add a segment as a constraint.\n \n The segment to add.\n \n \n \n Add the two points as a segment constraint.\n \n The segments point a.\n The segments point b.\n \n \n \n Add a list of segments as constraint to the triangulation.\n \n The segment array.\n The length of the segment array.\n \n \n \n Get a array of all the constraint edges in the triangulation.\n \n The edge array.\n The ararys length.\n \n \n \n Get a array of all the constraint segments in the triangulation.\n \n The segment array.\n The ararys length.\n \n \n \n Get the constraints incident to the vertex.\n \n The vertex index in the triangulation.\n The array of edges.\n The ararys length.\n \n \n \n Remove a constraint between a face and its neighbour.\n \n The faces index in the triangultion.\n The neighbours index in the faces neighbour array between 0-2.\n \n \n \n Remove all constraints incident to a vertex.\n \n The vertex index in the triangulation.\n \n \n \n Get the triangle indices for domain in the triangultion.\n Used to triangulate polygons.\n \n The indices.\n \n \n \n \n \n \n \n \n \n The generic constrained triangulation class.\n \n The kernel\n \n \n \n A static instance of the triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as a string.\n \n \n \n \n \n A deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n The abstract triangulation class.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the constrained triangulation.\n \n \n \n \n The number of constrainted edges in the triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n The moved vertex\n True if the vertex was found.\n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retain the poylgons edges.\n \n \n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points and the edges as constraints into the triangulation.\n Will retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Get the number of constrainted edges incident to this vertex.\n \n The vertex index in the triagulation.\n The number of constrainted edges to the vertex.\n \n \n \n Does this vertex have a constrainted edge.\n \n The vertex index in the triagulation.\n Does this vertex have a constrainted edge.\n \n \n \n Add a segment as a constraint.\n \n The segment to add.\n \n \n \n Add the two points as a segment constraint.\n \n The segments point a.\n The segments point b.\n \n \n \n Add a list of segments as constraint to the triangulation.\n \n The segment array.\n The length of the segment array.\n \n \n \n Get a array of all the constraint edges in the triangulation.\n \n The edge array.\n The ararys length.\n \n \n \n Get a array of all the constraint segments in the triangulation.\n \n The segment array.\n The ararys length.\n \n \n \n Get the constraints incident to the vertex.\n \n The vertex index in the triangulation.\n The array of edges.\n The ararys length.\n \n \n \n Remove a constraint between a face and its neighbour.\n \n The faces index in the triangultion.\n The neighbours index in the faces neighbour array between 0-2.\n \n \n \n Remove all constraints incident to a vertex.\n \n The vertex index in the triangulation.\n \n \n \n Get the triangle indices for domain in the triangultion.\n Used to triangulate polygons.\n \n The indices.\n \n \n \n \n \n \n \n \n \n The generic delaunay triangulation class.\n \n The kerne\n \n \n \n A static instance of the delaunay triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The triangulation as string.\n \n \n \n \n \n A deep copy of the triangulation.\n \n \n \n \n \n Insert the polygons points into the triangulation.\n May not retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Insert the polygons points into the triangulation.\n May not retatin the poylgons edges.\n \n The polygon to insert.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n The anstract base class for the delaunay triangulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the delaunay triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n If there is not already another vertex placed on the point, \n the triangulation is modified such that the new position of vertex same as point.\n The moved vertex\n True if the vertex was found.\n \n \n \n If the dual voronoi diagram of the triangulation is taken\n How many segments and rays would be produced.\n \n The number of segments.\n The number of rays.\n \n \n \n Get a array of the voronoi's segments.\n \n A array of the voronoi's segments.\n \n \n \n Get a array of the voronois rays.\n These are the segment at edge of triangulation that \n a end point can not be determined.\n \n A array of the voronoi's rays.\n \n \n \n \n \n \n \n \n \n Generic triangulation class.\n \n The kerel.\n \n \n \n Static instance of a triangulation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct a triangulation from the points.\n \n The triangulation points.\n \n \n \n Construct from a existing triangulation.\n \n A pointer to the unmanaged object.\n \n \n \n The triangulation as a string.\n \n \n \n \n \n Create a deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Refine the triangulation.\n \n The target edge lengths.\n The number of iterations.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n Abstract base class for the triagulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the triangulation.\n \n \n \n \n Move a vertex.\n \n The vertices index.\n The point to move to.\n Should the vertex only be moved if there is no coliision.\n If the vertex was moved.\n \n \n \n Find the index of the nearest vertex to the point.\n \n The point.\n The index of the nearest vertex to the point.\n \n \n \n Find the index of the nearest vertex to the point.\n Presumes poimt is in a cell.\n \n The cells index.\n The point.\n The index of the nearest vertex to the point.\n \n \n \n Remobe a vertex.\n \n The vertex index.\n True if vertex was removed.\n \n \n \n \n \n \n \n \n \n Generic triangulation class.\n \n The kerel.\n \n \n \n Static instance of a triangulation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct a triangulation from the points.\n \n The triangulation points.\n \n \n \n Construct from a existing triangulation.\n \n A pointer to the unmanaged object.\n \n \n \n The triangulation as a string.\n \n \n \n \n \n Create a deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Insert the points of the polygon into the triagulation.\n May no have the same edges as polygon.\n \n The polygon to insert/\n \n \n \n Insert the points of the polygon into the triagulation.\n May no have the same edges as polygon.\n \n The polygon to insert/\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n Abstract base class for the triagulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the triangulation.\n \n \n \n \n Move the vertex.\n \n \n \n If there is not already another vertex placed on the point, \n the triangulation is modified such that the new position of vertex same as point.\n The moved vertex\n True if the vertex was found.\n \n \n \n \n \n \n \n \n \n Generic triangulation class.\n \n The kerel.\n \n \n \n Static instance of a triangulation.\n \n \n \n \n Default constructor.\n \n \n \n \n Construct a triangulation from the points.\n \n The triangulation points.\n \n \n \n Construct from a existing triangulation.\n \n A pointer to the unmanaged object.\n \n \n \n The triangulation as a string.\n \n \n \n \n \n Create a deep copy of the triangulation.\n \n The deep copy.\n \n \n \n Refine the triangulation.\n \n The target edge lengths.\n The number of iterations.\n \n \n \n Compute the convex of the triagulation.\n \n The convex hull polygon.\n \n \n \n \n Abstract base class for the triagulation.\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n The kernel with the functions unique to the triangulation.\n \n \n \n \n \n \n \n \n \n \n From Index to HalfEdgeIndex must match layout\n of the unmanaged TriFace2 in the TriFace2 header file.\n \n \n \n \n Is this the infinite cell.\n \n \n \n \n The cells index in the triangulation.\n \n \n \n \n The cells 4 vertices.\n \n \n \n \n The cells 4 neighbor cells.\n \n \n \n \n \n \n \n \n \n \n Are the two cells equal.\n \n The first cell.\n The second cell.\n True if the cells are equal.\n \n \n \n Are the two cells not equal.\n \n The first cell.\n The second cell.\n True if the cells are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these cells equal.\n \n The other cell.\n True if the cells are equal.\n \n \n \n The cells hash code.\n \n The cells hash code.\n \n \n \n Get a vertex index.\n \n The vertices index 0-3.\n The vertices index in the triangulation.\n \n \n \n Get a neighbor cell index.\n \n The neighbor cell index 0-3.\n A neighbor cell index in the triangulation.\n \n \n \n Enumerate the vertices of the cell.\n \n The triangle the vertices below too.\n The cell vertices.\n \n \n \n Enumerate the vertices of the cell.\n \n The vertices array.\n The cell vertices.\n \n \n \n Enumerate the vertices of the cell.\n \n The triangle the vertices below too.\n The cell vertices.\n \n \n \n Enumerate the neighbors of the cell.\n \n The cell array.\n The cell neighbors.\n \n \n \n Are the two vertex arrays equal.\n \n \n \n \n \n \n \n Are the two neighbor arrays equal.\n \n \n \n \n \n \n \n From Index to TwinIndex must match layout\n of the unmanaged TriEdge2 in the TriEdge2 header file.\n \n \n \n \n The edges face index in the triangulation.\n \n \n \n \n The neighbours index in the face array betwen 0 and 2.\n \n \n \n \n The edges segment.\n \n \n \n \n \n \n The face index in the triangulation\n The neighbours index in the face array betwen 0 and 2.\n \n \n \n Are the two edges equal.\n \n The first edge.\n The second edge.\n True if the edges are equal.\n \n \n \n Are the two edges not equal.\n \n The first edge.\n The second edge.\n True if the edges are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these edges equal.\n \n The other edge.\n True if the edges are equal.\n \n \n \n The edges hash code.\n \n The edges hash code.\n \n \n \n From Index to HalfEdgeIndex must match layout\n of the unmanaged TriFace2 in the TriFace2 header file.\n \n \n \n \n Is this the infinite face.\n \n \n \n \n The faces index in the triangulation.\n \n \n \n \n The faces 3 vertices.\n \n \n \n \n \n \n \n \n \n \n Are the two faces equal.\n \n The first face.\n The second face.\n True if the faces are equal.\n \n \n \n Are the two faces not equal.\n \n The first face.\n The second face.\n True if the faces are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these faces equal.\n \n The other face.\n True if the faces are equal.\n \n \n \n The faces hash code.\n \n The faces hash code.\n \n \n \n Get a vertex index and wrap around array.\n \n The vertices index wrapped to 0-2.\n The vertices index in the triangulation.\n \n \n \n Enumerate the vertices of the face.\n \n The triangle the vertices below too.\n The face vertices.\n \n \n \n Enumerate the vertices of the face.\n \n The vertices array.\n The face vertices.\n \n \n \n From Point to HalfEdgeIndex must match layout\n of the unmanaged TriVertex2 in the TriVertex2 header file.\n \n \n \n \n The vertices point.\n \n \n \n \n Is this a infinite vertex.\n \n \n \n \n The number of egdes connected to the vertex.\n \n \n \n \n The vertices index in the triangulation.\n \n \n \n \n The one of the vertexs the vertex is connected to.\n \n \n \n \n Are the two vertexs equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are equal.\n \n \n \n Are the two vertexs not equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these vertexs equal.\n \n The other vertex.\n True if the vertexs are equal.\n \n \n \n The vertexs hash code.\n \n The vertexs hash code.\n \n \n \n \n \n \n \n \n The vertices point.\n \n \n \n \n Is this a infinte vertex.\n \n \n \n \n The vertices degree is the \n number of edges connecting to it.\n \n \n \n \n The vertices index in the triangulation.\n \n \n \n \n The one of the cells the vertex is connected to.\n \n \n \n \n Are the two vertices equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are equal.\n \n \n \n Are the two vertices not equal.\n \n The first vertex.\n The second vertex.\n True if the vertexs are not equal.\n \n \n \n Are these objects equal.\n \n The other object.\n True if the objects are equal.\n \n \n \n Are these vertexs equal.\n \n The other vertex.\n True if the vertexs are equal.\n \n \n \n The vertexs hash code.\n \n The vertexs hash code.\n \n \n \n Enumerate around all the other vertices in this vertexs cell.\n \n The triangulation the vertex belongs to.\n All the other vertices in this vertexs cell\n \n \n \n Enumerate around all the other vertices in this vertexs cell.\n \n A array of the other vertices in the triangulation.\n A array of the other cells in the triangulation.\n All the other vertices in this vertexs cell\n \n \n \n Cache to reuse arrays.\n Thread safe?\n \n \n \n \n Returns a array of Point2d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of Point2d objects that is at least the size of count.\n \n \n \n Returns a array of Segment2d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of Segment2d objects that is at least the size of count.\n \n \n \n Returns a array of Point3d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of Point3d objects that is at least the size of count.\n \n \n \n Returns a array of HPoint3d objects that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of HPoint3d objects that is at least the size of count.\n \n \n \n Returns a array of ints that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of ints that is at least the size of count.\n \n \n \n Returns a array of ints that is at least the size of count.\n \n The minimum size of the array.\n Should the array be cleared first.\n Returns a array of ints that is at least the size of count.\n \n \n \n Should a new array be created.\n \n The current array.\n The required new array size.\n Creates a new array if disabled, the current one is null or to small.\n \n \n \n Check a array that is passed to the c++ dll.\n If the array is invalid it will cause a hard crash.\n Array can be null if count is 0;\n \n \n \n \n \n\n"
},
{
"path": "CGALDotNet/CGALGlobal.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Runtime.CompilerServices;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\nusing CGALDotNet.Geometry;\n\n[assembly: InternalsVisibleTo(\"CGALDotNetConsole\")]\n[assembly: InternalsVisibleTo(\"CGALDotNetTest\")]\n\nnamespace CGALDotNet\n{\n /// \n /// Global utility functions.\n /// \n public static class CGALGlobal\n {\n public const int NULL_INDEX = -1;\n\n private const string DLL_NAME = \"CGALWrapper.dll\";\n\n private const CallingConvention CDECL = CallingConvention.Cdecl;\n\n /// \n /// Get the version of CGAL in use.\n /// \n public static string Version\n {\n get\n {\n int v = CGALGlobal_VersionNumber();\n\n int MAJOR = v / 10000000 % 100;\n int MINOR = v / 100000 % 100;\n int PATCH = v / 10000 % 10;\n int BUILD = v % 10000;\n\n return string.Format(\"{0}.{1}.{2}.{3}\", MAJOR, MINOR, PATCH, BUILD);\n }\n }\n\n /// \n /// Get the version of eigen being used.\n /// \n public static string EigenVersion\n {\n get\n {\n var v = CGALGlobal_EigenVersionNumber();\n\n int WORLD = v.first;\n int MAJOR = v.second;\n int MINOR = v.third;\n\n return string.Format(\"{0}.{1}.{2}\", WORLD, MAJOR, MINOR);\n }\n }\n\n /// \n /// Returns OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n /// \n /// The first vector.\n /// The second vector.\n /// OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n public static ANGLE Angle(Vector2d u, Vector2d v)\n {\n return CGALGlobal_EIK_Angle_Vector2(u, v);\n }\n\n /// \n /// Returns OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n /// \n /// The first vector.\n /// The second vector.\n /// OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n public static ANGLE Angle(Vector2 u, Vector2 v)\n {\n return CGALGlobal_EIK_Angle_Vector2(u.Ptr, v.Ptr);\n }\n\n /// \n /// Returns OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n /// \n /// The first vector.\n /// The second vector.\n /// OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n public static ANGLE Angle(Vector2 u, Vector2 v)\n {\n return CGALGlobal_EEK_Angle_Vector2(u.Ptr, v.Ptr);\n }\n\n /// \n /// returns OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n /// \n /// The first vector.\n /// The second vector.\n /// OBTUSE, RIGHT or ACUTE depending on the \n /// angle formed by the two vectors u and v.\n public static ANGLE Angle(Vector3d u, Vector3d v)\n {\n return CGALGlobal_EIK_Angle_Vector3d(u, v);\n }\n\n /// \n /// Returns an approximation of the angle between u and v.\n /// \n /// The first vector.\n /// The second vector.\n /// The angle is given in degrees.\n public static Degree ApproxAngle(Vector2d u, Vector2d v)\n {\n return new Degree(CGALGlobal_EIK_ApproxAngle_Vector3d(u.xy0, v.xy0));\n }\n\n /// \n /// Returns an approximation of the angle between p-q and r-q.\n /// \n /// The first tetrahedrons point.\n /// The second tetrahedrons point.\n /// The third tetrahedrons point.\n /// The angle is given in degrees.\n public static Degree ApproxAngle(Point2d p, Point2d q, Point2d r)\n {\n var u = Point2d.Direction(q, p).xy0;\n var v = Point2d.Direction(q, r).xy0;\n\n return new Degree(CGALGlobal_EIK_ApproxAngle_Vector3d(u, v));\n }\n\n /// \n /// Returns an approximation of the angle between u and v.\n /// \n /// The first vector.\n /// The second vector.\n /// The angle is given in degrees.\n public static Degree ApproxAngle(Vector3d u, Vector3d v)\n {\n return new Degree(CGALGlobal_EIK_ApproxAngle_Vector3d(u, v));\n }\n\n /// \n /// Returns an approximation of the angle between p-q and r-q.\n /// \n /// The first tetrahedrons point.\n /// The second tetrahedrons point.\n /// The third tetrahedrons point.\n /// The angle is given in degrees.\n public static Degree ApproxAngle(Point3d p, Point3d q, Point3d r)\n {\n var u = Point3d.Direction(q, p);\n var v = Point3d.Direction(q, r);\n\n return new Degree(CGALGlobal_EIK_ApproxAngle_Vector3d(u, v));\n }\n\n /// \n /// Returns an approximation of the signed dihedral angle \n /// in the tetrahedron pqrs of edge pq.\n /// p,q,r and p,q,s are not collinear.\n /// \n /// The first tetrahedrons point.\n /// The second tetrahedrons point.\n /// The third tetrahedrons point.\n /// The fourth tetrahedrons point.\n /// The sign is negative if orientation(p,q,r,s) \n /// is CGAL::NEGATIVE and positive otherwise.\n /// The angle is given in degrees.\n public static Degree ApproxDihedralAngle(Point3d p, Point3d q, Point3d r, Point3d s)\n {\n return new Degree(CGALGlobal_EIK_ApproxDihedralAngle_Point3(p, q, r, s));\n }\n\n /// \n /// Returns true, if the three points are collinear \n /// and q lies between p and r.\n /// Note that true is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true, if the three points are \n /// collinear and q lies between p and r.\n public static bool AreOrderedAlongLine(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_AreOrderedAlongLine_Point2d(p, q, r);\n }\n\n /// \n /// Returns true, if the three points are collinear \n /// and q lies between p and r.\n /// Note that true is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true, if the three points are \n /// collinear and q lies between p and r.\n public static bool AreOrderedAlongLine(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_AreOrderedAlongLine_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true, if the three points are collinear \n /// and q lies between p and r.\n /// Note that true is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true, if the three points are \n /// collinear and q lies between p and r.\n public static bool AreOrderedAlongLine(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EEK_AreOrderedAlongLine_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true, if the three points are collinear \n /// and q lies between p and r.\n /// Note that true is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true, if the three points are \n /// collinear and q lies between p and r.\n public static bool AreOrderedAlongLine(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_AreOrderedAlongLine_Point3d(p, q, r);\n }\n\n /// \n /// returns true, if the three points are collinear \n /// and q lies strictly between p and r.\n /// Note that false is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, iff the three points are \n /// collinear and q lies strictly between p and r.\n public static bool AreStrictlyOrderedAlongLine(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_AreStrictlyOrderedAlongLine_Point2d(p, q, r);\n }\n\n /// \n /// returns true, if the three points are collinear \n /// and q lies strictly between p and r.\n /// Note that false is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, iff the three points are \n /// collinear and q lies strictly between p and r.\n public static bool AreStrictlyOrderedAlongLine(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_AreStrictlyOrderedAlongLine_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// returns true, if the three points are collinear \n /// and q lies strictly between p and r.\n /// Note that false is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, iff the three points are \n /// collinear and q lies strictly between p and r.\n public static bool AreStrictlyOrderedAlongLine(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EEK_AreStrictlyOrderedAlongLine_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// returns true, if the three points are collinear \n /// and q lies strictly between p and r.\n /// Note that false is returned, if q==p or q==r.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, iff the three points are \n /// collinear and q lies strictly between p and r.\n public static bool AreStrictlyOrderedAlongLine(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_AreStrictlyOrderedAlongLine_Point3d(p, q, r);\n }\n\n /// \n /// Returns true, if p, q, and r are collinear\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, if p, q, and r are collinear\n public static bool Collinear(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_Collinear_Point2d(p, q, r);\n }\n\n /// \n /// Returns true, if p, q, and r are collinear\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, if p, q, and r are collinear\n public static bool Collinear(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_Collinear_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true, if p, q, and r are collinear\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// returns true, if p, q, and r are collinear\n public static bool Collinear(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EEK_Collinear_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true, if p, q, and r are collinear\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true, iff p, q, and r are collinear\n public static bool Collinear(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_Collinear_Point3d(p, q, r);\n }\n\n /// \n /// Compute the barycenter of the points p1, p2 and p3 \n /// with corresponding weights w1, w2 and w3 as 1.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Compute the barycenter of the points.\n public static Point2d Barycenter(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_Barycenter_Point2d(p, q, r);\n }\n\n /// \n /// Compute the barycenter of the points p1, p2 and p3 \n /// with corresponding weights w1, w2 and w3 as 1.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Compute the barycenter of the points.\n public static Point2 Barycenter(Point2 p, Point2 q, Point2 r)\n {\n var ptr = CGALGlobal_EIK_Barycenter_Point2(p.Ptr, q.Ptr, r.Ptr);\n return new Point2(ptr);\n }\n\n /// \n /// Compute the barycenter of the points p1, p2 and p3 \n /// with corresponding weights w1, w2 and w3 as 1.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Compute the barycenter of the points.\n public static Point2 Barycenter(Point2 p, Point2 q, Point2 r)\n {\n var ptr = CGALGlobal_EEK_Barycenter_Point2(p.Ptr, q.Ptr, r.Ptr);\n return new Point2(ptr);\n }\n\n /// \n /// Compute the barycenter of the points p1, p2 and p3 \n /// with corresponding weights w1, w2 and w3 as 1.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Compute the barycenter of the points.\n public static Point3d Barycenter(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_Barycenter_Point3d(p, q, r);\n }\n\n /// \n /// Constructs the bisector line of the two points p and q.\n /// The bisector is oriented in such a way that p lies on its positive side.\n /// \n /// The first point.\n /// The second point.\n /// Constructs the bisector line of the two points p and q.\n public static Line2d Bisector(Point3d p, Point3d q)\n {\n return CGALGlobal_EIK_Bisector_Point3d(p, q);\n }\n\n /// \n /// Constructs the bisector of the two lines l1 and l2.\n /// \n /// In the general case, the bisector has the direction of\n /// the vector which is the sum of the normalized directions \n /// of the two lines, and which passes through the intersection \n /// of l1 and l2. If l1 and l2 are parallel, then the bisector \n /// is defined as the line which has the same direction as l1, \n /// and which is at the same distance from l1 and l2. \n /// If Kernel::FT is not a model of FieldWithSqrt an \n /// approximation of the square root will be used in this \n /// function, impacting the exactness of the result even \n /// with an (exact) multiprecision number type.\n /// \n /// The first line.\n /// The second line.\n /// Constructs the bisector of the two lines l1 and l2.\n public static Line2d Bisector(Line2d l1, Line2d l2)\n {\n return CGALGlobal_EIK_Bisector_Line2d(l1, l2);\n }\n\n /// \n /// Constructs the bisector of the two lines l1 and l2.\n /// \n /// In the general case, the bisector has the direction of\n /// the vector which is the sum of the normalized directions \n /// of the two lines, and which passes through the intersection \n /// of l1 and l2. If l1 and l2 are parallel, then the bisector \n /// is defined as the line which has the same direction as l1, \n /// and which is at the same distance from l1 and l2. \n /// If Kernel::FT is not a model of FieldWithSqrt an \n /// approximation of the square root will be used in this \n /// function, impacting the exactness of the result even \n /// with an (exact) multiprecision number type.\n /// \n /// The first line.\n /// The second line.\n /// Constructs the bisector of the two lines l1 and l2.\n public static Line2 Bisector(Line2 l1, Line2 l2)\n {\n var ptr = CGALGlobal_EIK_Bisector_Line2(l1.Ptr, l2.Ptr);\n return new Line2(ptr);\n }\n\n /// \n /// Constructs the bisector of the two lines l1 and l2.\n /// \n /// In the general case, the bisector has the direction of\n /// the vector which is the sum of the normalized directions \n /// of the two lines, and which passes through the intersection \n /// of l1 and l2. If l1 and l2 are parallel, then the bisector \n /// is defined as the line which has the same direction as l1, \n /// and which is at the same distance from l1 and l2. \n /// If Kernel::FT is not a model of FieldWithSqrt an \n /// approximation of the square root will be used in this \n /// function, impacting the exactness of the result even \n /// with an (exact) multiprecision number type.\n /// \n /// The first line.\n /// The second line.\n /// Constructs the bisector of the two lines l1 and l2.\n public static Line2 Bisector(Line2 l1, Line2 l2)\n {\n var ptr = CGALGlobal_EEK_Bisector_Line2(l1.Ptr, l2.Ptr);\n return new Line2(ptr);\n }\n\n /// \n /// Returns true, if p, q, r, and s are coplanar.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// The fourth point\n /// Returns true, if p, q, r, and s are coplanar.\n public static bool Coplanar(Point3d p, Point3d q, Point3d r, Point3d s)\n {\n return CGALGlobal_EIK_Coplanar_Point3d(p, q, r, s);\n }\n\n /// \n /// If p,q,r are collinear, then CGAL_COLLINEAR is returned.\n /// If not, then p,q,r define a plane p. The return value in this \n /// case is either CGAL_POSITIVE or CGAL_NEGATIVE, but we don't \n /// specify it explicitly. However, we guarantee that all calls to\n /// this predicate over 3 points in p will return a coherent \n /// orientation if considered a 2D orientation in p\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// If p,q,r are collinear, then CGAL_COLLINEAR is returned.\n public static ORIENTATION CoplanarOrientation(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_CoplanarOrientation_3Point3d(p, q, r);\n }\n\n /// \n /// Let P be the plane defined by the points p, q, and r.\n /// Note that the order defines the orientation of P. The function computes \n /// the orientation of points p, q, and s in P: If p, q, s are collinear, \n /// CGAL_COLLINEAR is returned. If P and the plane defined by p, q,\n /// and s have the same orientation, CGAL_POSITIVE is returned; \n /// otherwise CGAL_NEGATIVE is returned.\n /// p, q, r, and s are coplanar and p, q, and r are not collinear.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// The fourth point\n /// \n public static ORIENTATION CoplanarOrientation(Point3d p, Point3d q, Point3d r, Point3d s)\n {\n return CGALGlobal_EIK_CoplanarOrientation_4Point3d(p, q, r, s);\n }\n\n /// \n /// Constructs the line which is at the same distance from the three points p, q and r.\n /// p, q and r are not collinear.\n /// \n /// \n /// \n /// \n /// Constructs the line which is at the same distance from the three points p, q and r.\n public static Line3d EquidistantLine(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_EquidistantLine_Line3d(p, q, r);\n }\n\n /// \n /// Returns true if p, q, and r form a left turn.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true if p, q, and r form a left turn.\n public static bool LeftTurn(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_LeftTurn_Point2d(p, q, r);\n }\n\n /// \n /// Returns true if p, q, and r form a left turn.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true if p, q, and r form a left turn.\n public static bool LeftTurn(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_LeftTurn_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true if p, q, and r form a left turn.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true if p, q, and r form a left turn.\n public static bool LeftTurn(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EEK_LeftTurn_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true if p, q, and r form a right turn.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true if p, q, and r form a right turn.\n public static bool RightTurn(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_RightTurn_Point2d(p, q, r);\n }\n\n /// \n /// Returns true if p, q, and r form a right turn.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true if p, q, and r form a right turn.\n public static bool RightTurn(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_RightTurn_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns true if p, q, and r form a right turn.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// Returns true if p, q, and r form a right turn.\n public static bool RightTurn(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_RightTurn_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns LEFT_TURN, if r lies to the left of the oriented \n /// line l defined by p and q, returns RIGHT_TURN if r lies \n /// to the right of l, and returns COLLINEAR if r lies on l.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// \n public static ORIENTATION Orientation(Point2d p, Point2d q, Point2d r)\n {\n return CGALGlobal_EIK_Orientation_Point2d(p, q, r);\n }\n\n /// \n /// Returns LEFT_TURN, if r lies to the left of the oriented \n /// line l defined by p and q, returns RIGHT_TURN if r lies \n /// to the right of l, and returns COLLINEAR if r lies on l.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// \n public static ORIENTATION Orientation(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EIK_Orientation_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// Returns LEFT_TURN, if r lies to the left of the oriented \n /// line l defined by p and q, returns RIGHT_TURN if r lies \n /// to the right of l, and returns COLLINEAR if r lies on l.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// \n public static ORIENTATION Orientation(Point2 p, Point2 q, Point2 r)\n {\n return CGALGlobal_EEK_Orientation_Point2(p.Ptr, q.Ptr, r.Ptr);\n }\n\n /// \n /// returns LEFT_TURN if u and v form a left turn, returns \n /// RIGHT_TURN if u and v form a right turn, and returns \n /// COLLINEAR if u and v are collinear.\n /// \n /// \n /// \n /// \n public static ORIENTATION Orientation(Vector2d u, Vector2d v)\n {\n return CGALGlobal_EIK_Orientation_Vector2d(u, v);\n }\n\n /// \n /// Returns LEFT_TURN, if r lies to the left of the oriented \n /// line l defined by p and q, returns RIGHT_TURN if r lies \n /// to the right of l, and returns COLLINEAR if r lies on l.\n /// \n /// The first point.\n /// The second point.\n /// \n public static ORIENTATION Orientation(Vector2 p, Vector2 q)\n {\n return CGALGlobal_EIK_Orientation_Vector2(p.Ptr, q.Ptr);\n }\n\n /// \n /// Returns LEFT_TURN, if r lies to the left of the oriented \n /// line l defined by p and q, returns RIGHT_TURN if r lies \n /// to the right of l, and returns COLLINEAR if r lies on l.\n /// \n /// The first point.\n /// The second point.\n /// \n public static ORIENTATION Orientation(Vector2 p, Vector2 q)\n {\n return CGALGlobal_EEK_Orientation_Vector2(p.Ptr, q.Ptr);\n }\n\n /// \n /// returns POSITIVE, if s lies on the positive side of the \n /// oriented plane h defined by p, q, and r, returns NEGATIVE\n /// if s lies on the negative side of h, and returns COPLANAR \n /// if s lies on h.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// The fourth point\n /// \n public static ORIENTATION Orientation(Point3d p, Point3d q, Point3d r, Point3d s)\n {\n return CGALGlobal_EIK_Orientation_Point3d(p, q, r, s);\n }\n\n /// \n /// returns NEGATIVE if u, v and w are negatively oriented, \n /// POSITIVE if u, v and w are positively oriented,\n /// and COPLANAR if u, v and w are coplanar.\n /// \n /// \n /// \n /// \n /// \n public static ORIENTATION Orientation(Vector3d u, Vector3d v, Vector3d w)\n {\n return CGALGlobal_EIK_Orientation_Vector3d(u, v, w);\n }\n\n /// \n /// computes an orthogonal vector of the plane defined by p, q\n /// and r, which is directed to the positive side of this plane.\n /// \n /// The first point.\n /// The second point.\n /// The third point.\n /// computes an orthogonal vector of the plane\n public static Vector3d OrthogonalVector(Point3d p, Point3d q, Point3d r)\n {\n return CGALGlobal_EIK_OrthogonalVector_Point3d(p, q, r);\n }\n\n /// \n /// returns true, if l1 and l2 are parallel or if one of those \n /// (or both) is degenerate.\n /// \n /// The first line.\n /// The seconed line.\n /// returns true, if l1 and l2 are parallel\n public static bool Parallel(Line2d l1, Line2d l2)\n {\n return CGALGlobal_EIK_Parallel_Line2d(l1, l2);\n }\n\n /// \n /// returns true, if l1 and l2 are parallel or if one of those \n /// (or both) is degenerate.\n /// \n /// The first line.\n /// The seconed line.\n /// returns true, if l1 and l2 are parallel\n public static bool Parallel(Line2 l1, Line2 l2)\n {\n return CGALGlobal_EIK_Parallel_Line2(l1.Ptr, l2.Ptr);\n }\n\n /// \n /// returns true, if l1 and l2 are parallel or if one of those \n /// (or both) is degenerate.\n /// \n /// The first line.\n /// The seconed line.\n /// returns true, if l1 and l2 are parallel\n public static bool Parallel(Line2 l1, Line2 l2)\n {\n return CGALGlobal_EEK_Parallel_Line2(l1.Ptr, l2.Ptr);\n }\n\n /// \n /// returns true, if r1 and r2 are parallel or if one of \n /// those (or both) is degenerate.\n /// \n /// The first ray.\n /// The second ray.\n /// returns true, if r1 and r2 are parallel\n public static bool Parallel(Ray2d r1, Ray2d r2)\n {\n return CGALGlobal_EIK_Parallel_Ray2d(r1, r2);\n }\n\n /// \n /// returns true, if r1 and r2 are parallel or if one of \n /// those (or both) is degenerate.\n /// \n /// The first ray.\n /// The second ray.\n /// returns true, if r1 and r2 are parallel\n public static bool Parallel(Ray2 r1, Ray2 r2)\n {\n return CGALGlobal_EIK_Parallel_Ray2(r1.Ptr, r2.Ptr);\n }\n\n /// \n /// returns true, if r1 and r2 are parallel or if one of \n /// those (or both) is degenerate.\n /// \n /// The first ray.\n /// The second ray.\n /// returns true, if r1 and r2 are parallel\n public static bool Parallel(Ray2 r1, Ray2 r2)\n {\n return CGALGlobal_EEK_Parallel_Ray2(r1.Ptr, r2.Ptr);\n }\n\n /// \n /// returns true, if s1 and s2 are parallel or if one of \n /// those (or both) is degenerate.\n /// \n /// The first segment.\n /// The secong segment.\n /// returns true, if s1 and s2 are parallel\n public static bool Parallel(Segment2d s1, Segment2d s2)\n {\n return CGALGlobal_EIK_Parallel_Segment2d(s1, s2);\n }\n\n /// \n /// returns true, if s1 and s2 are parallel or if one of \n /// those (or both) is degenerate.\n /// \n /// The first segment.\n /// The secong segment.\n /// returns true, if s1 and s2 are parallel\n public static bool Parallel(Segment2 s1, Segment2 s2)\n {\n return CGALGlobal_EIK_Parallel_Segment2(s1.Ptr, s2.Ptr);\n }\n\n /// \n /// returns true, if s1 and s2 are parallel or if one of \n /// those (or both) is degenerate.\n /// \n /// The first segment.\n /// The secong segment.\n /// returns true, if s1 and s2 are parallel\n public static bool Parallel(Segment2 s1, Segment2 s2)\n {\n return CGALGlobal_EEK_Parallel_Segment2(s1.Ptr, s2.Ptr);\n }\n\n //---------------------------------------------------------------------------//\n // Version //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int CGALGlobal_VersionNumber();\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Index3 CGALGlobal_EigenVersionNumber();\n\n //---------------------------------------------------------------------------//\n // Angle //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ANGLE CGALGlobal_EIK_Angle_Vector2(Vector2d u, Vector2d v);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ANGLE CGALGlobal_EIK_Angle_Vector2(IntPtr u, IntPtr v);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ANGLE CGALGlobal_EEK_Angle_Vector2(IntPtr u, IntPtr v);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ANGLE CGALGlobal_EIK_Angle_Vector3d(Vector3d u, Vector3d v);\n\n //---------------------------------------------------------------------------//\n // ApproxAngle //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double CGALGlobal_EIK_ApproxAngle_Vector3d(Vector3d u, Vector3d v);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double CGALGlobal_EIK_ApproxAngle_Vector2(IntPtr u, IntPtr v);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double CGALGlobal_EEK_ApproxAngle_Vector2(IntPtr u, IntPtr v);\n\n //---------------------------------------------------------------------------//\n // ApproxDihedralAngle //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double CGALGlobal_EIK_ApproxDihedralAngle_Point3(Point3d p, Point3d q, Point3d r, Point3d s);\n\n //---------------------------------------------------------------------------//\n // AreOrderedAlongLine //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_AreOrderedAlongLine_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_AreOrderedAlongLine_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_AreOrderedAlongLine_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_AreOrderedAlongLine_Point3d(Point3d p, Point3d q, Point3d r);\n\n //---------------------------------------------------------------------------//\n // AreStrictlyOrderedAlongLine //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_AreStrictlyOrderedAlongLine_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_AreStrictlyOrderedAlongLine_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_AreStrictlyOrderedAlongLine_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_AreStrictlyOrderedAlongLine_Point3d(Point3d p, Point3d q, Point3d r);\n\n //---------------------------------------------------------------------------//\n // Collinear //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Collinear_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Collinear_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_Collinear_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Collinear_Point3d(Point3d p, Point3d q, Point3d r);\n\n //---------------------------------------------------------------------------//\n // Barycenter //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Point2d CGALGlobal_EIK_Barycenter_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr CGALGlobal_EIK_Barycenter_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr CGALGlobal_EEK_Barycenter_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Point3d CGALGlobal_EIK_Barycenter_Point3d(Point3d p, Point3d q, Point3d r);\n\n //---------------------------------------------------------------------------//\n // Bisector //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Line2d CGALGlobal_EIK_Bisector_Point3d(Point3d p, Point3d q);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Line2d CGALGlobal_EIK_Bisector_Line2d(Line2d p, Line2d q);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr CGALGlobal_EIK_Bisector_Line2(IntPtr p, IntPtr q);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr CGALGlobal_EEK_Bisector_Line2(IntPtr p, IntPtr q);\n\n //---------------------------------------------------------------------------//\n // Coplanar //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Coplanar_Point3d(Point3d p, Point3d q, Point3d r, Point3d s);\n\n //---------------------------------------------------------------------------//\n // CoplanarOrientation //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_CoplanarOrientation_3Point3d(Point3d p, Point3d q, Point3d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_CoplanarOrientation_4Point3d(Point3d p, Point3d q, Point3d r, Point3d s);\n\n //---------------------------------------------------------------------------//\n // EquidistantLine //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Line3d CGALGlobal_EIK_EquidistantLine_Line3d(Point3d p, Point3d q, Point3d r);\n\n //---------------------------------------------------------------------------//\n // LeftTurn //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_LeftTurn_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_LeftTurn_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_LeftTurn_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n //---------------------------------------------------------------------------//\n // RightTurn //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_RightTurn_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_RightTurn_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_RightTurn_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n //---------------------------------------------------------------------------//\n // Orientation //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_Orientation_Point2d(Point2d p, Point2d q, Point2d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_Orientation_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EEK_Orientation_Point2(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_Orientation_Vector2d(Vector2d u, Vector2d v);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_Orientation_Vector2(IntPtr p, IntPtr q);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EEK_Orientation_Vector2(IntPtr p, IntPtr q);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_Orientation_Point3d(Point3d p, Point3d q, Point3d r, Point3d s);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern ORIENTATION CGALGlobal_EIK_Orientation_Vector3d(Vector3d u, Vector3d v, Vector3d w);\n\n //---------------------------------------------------------------------------//\n // OrthogonalVector //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern Vector3d CGALGlobal_EIK_OrthogonalVector_Point3d(Point3d p, Point3d q, Point3d r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr CGALGlobal_EIK_OrthogonalVector_Point3(IntPtr p, IntPtr q, IntPtr r);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr CGALGlobal_EEK_OrthogonalVector_Point3(IntPtr p, IntPtr q, IntPtr r);\n\n //---------------------------------------------------------------------------//\n // Parallel //\n //---------------------------------------------------------------------------//\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Parallel_Line2d(Line2d l1, Line2d l2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Parallel_Line2(IntPtr l1, IntPtr l2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_Parallel_Line2(IntPtr l1, IntPtr l2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Parallel_Ray2d(Ray2d r1, Ray2d r2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Parallel_Ray2(IntPtr l1, IntPtr l2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_Parallel_Ray2(IntPtr l1, IntPtr l2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Parallel_Segment2d(Segment2d s1, Segment2d s2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EIK_Parallel_Segment2(IntPtr l1, IntPtr l2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern bool CGALGlobal_EEK_Parallel_Segment2(IntPtr l1, IntPtr l2);\n\n }\n}\n"
},
{
"path": "CGALDotNet/CGALKernel.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNet.Geometry;\nusing CGALDotNet.Polylines;\nusing CGALDotNet.Polygons;\nusing CGALDotNet.Arrangements;\nusing CGALDotNet.Triangulations;\nusing CGALDotNet.Hulls;\nusing CGALDotNet.Polyhedra;\nusing CGALDotNet.Meshing;\nusing CGALDotNet.Processing;\n\nnamespace CGALDotNet\n{\n public abstract class CGALKernel\n {\n\n internal abstract GeometryKernel2 GeometryKernel2 { get; }\n\n internal abstract PolylineKernel2 PolylineKernel2 { get; }\n\n internal abstract PolylineKernel3 PolylineKernel3 { get; }\n\n internal abstract PolygonKernel2 PolygonKernel2 { get; }\n\n internal abstract PolygonWithHolesKernel2 PolygonWithHolesKernel2 { get; }\n\n internal abstract PolygonBooleanKernel2 PolygonBooleanKernel2 { get; }\n\n internal abstract PolygonPartitionKernel2 PolygonPartitionKernel2 { get; }\n\n internal abstract PolygonSimplificationKernel2 PolygonSimplificationKernel2 { get; }\n\n internal abstract PolygonOffsetKernel2 PolygonOffsetKernel2 { get; }\n\n internal abstract PolygonMinkowskiKernel PolygonMinkowskiKernel { get; }\n\n internal abstract PolygonVisibilityKernel PolygonVisibilityKernel { get; }\n\n internal abstract ArrangementKernel2 ArrangementKernel2 { get; }\n\n internal abstract SweepLineKernel SweepLineKernel { get; }\n\n internal abstract TriangulationKernel2 TriangulationKernel2 { get; }\n\n internal abstract TriangulationKernel3 TriangulationKernel3 { get; }\n\n internal abstract DelaunayTriangulationKernel2 DelaunayTriangulationKernel2 { get; }\n\n internal abstract DelaunayTriangulationKernel3 DelaunayTriangulationKernel3 { get; }\n\n internal abstract ConstrainedTriangulationKernel2 ConstrainedTriangulationKernel2 { get; }\n\n internal abstract ConstrainedDelaunayTriangulationKernel2 ConstrainedDelaunayTriangulationKernel2 { get; }\n\n internal abstract ConformingTriangulationKernel2 ConformingTriangulationKernel2 { get; }\n\n internal abstract ConvexHullKernel2 ConvexHullKernel2 { get; }\n\n internal abstract ConvexHullKernel3 ConvexHullKernel3 { get; }\n\n internal abstract PolyhedronKernel3 PolyhedronKernel3 { get; }\n\n internal abstract NefPolyhedronKernel3 NefPolyhedronKernel3 { get; }\n\n internal abstract SurfaceMeshKernel3 SurfaceMeshKernel3 { get; }\n\n internal abstract TetrahedralRemeshingKernel TetrahedralRemeshingKernel { get; }\n\n internal abstract SurfaceSubdivisionKernel SurfaceSubdivisionKernel { get; }\n\n internal abstract SurfaceSimplificationKernel SurfaceSimplificationKernel { get; }\n\n internal abstract SkinSurfaceMeshingKernel SkinSurfaceMeshingKernel { get; }\n\n internal abstract MeshProcessingMeshingKernel MeshProcessingMeshingKernel { get; }\n\n internal abstract MeshProcessingRepairKernel MeshProcessingRepairKernel { get; }\n\n internal abstract MeshProcessingOrientationKernel MeshProcessingOrientationKernel { get; }\n\n internal abstract MeshProcessingBooleanKernel MeshProcessingBooleanKernel { get; }\n\n internal abstract MeshProcessingConnectionsKernel MeshProcessingConnectionsKernel { get; }\n\n internal abstract MeshProcessingSlicerKernel MeshProcessingSlicerKernel { get; }\n\n internal abstract MeshProcessingFeaturesKernel MeshProcessingFeaturesKernel { get; }\n\n internal abstract MeshProcessingLocateKernel MeshProcessingLocateKernel { get; }\n\n internal abstract HeatMethodKernel HeatMethodKernel { get; }\n }\n\n public class EIK : CGALKernel\n {\n public static readonly EIK Instance = new EIK();\n\n internal override GeometryKernel2 GeometryKernel2 => GeometryKernel2_EIK.Instance;\n\n internal override PolylineKernel2 PolylineKernel2 => PolylineKernel2_EIK.Instance;\n\n internal override PolylineKernel3 PolylineKernel3 => PolylineKernel3_EIK.Instance;\n\n internal override PolygonKernel2 PolygonKernel2 => PolygonKernel2_EIK.Instance;\n\n internal override PolygonWithHolesKernel2 PolygonWithHolesKernel2 => PolygonWithHolesKernel2_EIK.Instance;\n\n internal override PolygonBooleanKernel2 PolygonBooleanKernel2 => PolygonBooleanKernel2_EIK.Instance;\n\n internal override PolygonPartitionKernel2 PolygonPartitionKernel2 => PolygonPartitionKernel2_EIK.Instance;\n\n internal override PolygonSimplificationKernel2 PolygonSimplificationKernel2 => PolygonSimplificationKernel2_EIK.Instance;\n\n internal override PolygonOffsetKernel2 PolygonOffsetKernel2 => PolygonOffsetKernel2_EIK.Instance;\n\n internal override PolygonMinkowskiKernel PolygonMinkowskiKernel => PolygonMinkowskiKernel_EIK.Instance;\n\n internal override PolygonVisibilityKernel PolygonVisibilityKernel => PolygonVisibilityKernel_EIK.Instance;\n\n internal override ArrangementKernel2 ArrangementKernel2 => throw new NotImplementedException();\n\n internal override SweepLineKernel SweepLineKernel => SweepLineKernel_EIK.Instance;\n\n internal override TriangulationKernel2 TriangulationKernel2 => TriangulationKernel2_EIK.Instance;\n\n internal override TriangulationKernel3 TriangulationKernel3 => throw new NotImplementedException();\n\n internal override DelaunayTriangulationKernel2 DelaunayTriangulationKernel2 => DelaunayTriangulationKernel2_EIK.Instance;\n\n internal override DelaunayTriangulationKernel3 DelaunayTriangulationKernel3 => throw new NotImplementedException();\n\n internal override ConstrainedTriangulationKernel2 ConstrainedTriangulationKernel2 => ConstrainedTriangulationKernel2_EIK.Instance;\n\n internal override ConstrainedDelaunayTriangulationKernel2 ConstrainedDelaunayTriangulationKernel2 => throw new NotImplementedException();\n\n internal override ConformingTriangulationKernel2 ConformingTriangulationKernel2 => ConformingTriangulationKernel2_EIK.Instance;\n\n internal override ConvexHullKernel2 ConvexHullKernel2 => ConvexHullKernel2_EIK.Instance;\n\n internal override ConvexHullKernel3 ConvexHullKernel3 => ConvexHullKernel3_EIK.Instance;\n\n internal override PolyhedronKernel3 PolyhedronKernel3 => PolyhedronKernel3_EIK.Instance;\n\n internal override NefPolyhedronKernel3 NefPolyhedronKernel3 => NefPolyhedronKernel3_EIK.Instance;\n\n internal override SurfaceMeshKernel3 SurfaceMeshKernel3 => SurfaceMeshKernel3_EIK.Instance;\n\n internal override TetrahedralRemeshingKernel TetrahedralRemeshingKernel => throw new NotImplementedException();\n\n internal override SurfaceSubdivisionKernel SurfaceSubdivisionKernel => SurfaceSubdivisionKernel_EIK.Instance;\n\n internal override SurfaceSimplificationKernel SurfaceSimplificationKernel => SurfaceSimplificationKernel_EIK.Instance;\n\n internal override SkinSurfaceMeshingKernel SkinSurfaceMeshingKernel => throw new NotImplementedException();\n\n internal override MeshProcessingMeshingKernel MeshProcessingMeshingKernel => MeshProcessingMeshingKernel_EIK.Instance;\n\n internal override MeshProcessingRepairKernel MeshProcessingRepairKernel => MeshProcessingRepairKernel_EIK.Instance;\n\n internal override MeshProcessingOrientationKernel MeshProcessingOrientationKernel => MeshProcessingOrientationKernel_EIK.Instance;\n\n internal override MeshProcessingBooleanKernel MeshProcessingBooleanKernel => MeshProcessingBooleanKernel_EIK.Instance;\n\n internal override MeshProcessingConnectionsKernel MeshProcessingConnectionsKernel => MeshProcessingConnectionsKernel_EIK.Instance;\n\n internal override MeshProcessingSlicerKernel MeshProcessingSlicerKernel => MeshProcessingSlicerKernel_EIK.Instance;\n\n internal override MeshProcessingFeaturesKernel MeshProcessingFeaturesKernel => MeshProcessingFeaturesKernel_EIK.Instance;\n\n internal override MeshProcessingLocateKernel MeshProcessingLocateKernel => MeshProcessingLocateKernel_EIK.Instance;\n\n internal override HeatMethodKernel HeatMethodKernel => HeatMethodKernel_EIK.Instance;\n }\n\n public class EEK : CGALKernel\n {\n public static readonly EEK Instance = new EEK();\n\n internal override GeometryKernel2 GeometryKernel2 => GeometryKernel2_EEK.Instance;\n\n internal override PolylineKernel2 PolylineKernel2 => PolylineKernel2_EEK.Instance;\n\n internal override PolylineKernel3 PolylineKernel3 => PolylineKernel3_EEK.Instance;\n\n internal override PolygonKernel2 PolygonKernel2 => PolygonKernel2_EEK.Instance;\n\n internal override PolygonWithHolesKernel2 PolygonWithHolesKernel2 => PolygonWithHolesKernel2_EEK.Instance;\n\n internal override PolygonBooleanKernel2 PolygonBooleanKernel2 => PolygonBooleanKernel2_EEK.Instance;\n\n internal override PolygonPartitionKernel2 PolygonPartitionKernel2 => PolygonPartitionKernel2_EEK.Instance;\n\n internal override PolygonSimplificationKernel2 PolygonSimplificationKernel2 => PolygonSimplificationKernel2_EEK.Instance;\n\n internal override PolygonOffsetKernel2 PolygonOffsetKernel2 => PolygonOffsetKernel2_EEK.Instance;\n\n internal override PolygonMinkowskiKernel PolygonMinkowskiKernel => PolygonMinkowskiKernel_EEK.Instance;\n\n internal override PolygonVisibilityKernel PolygonVisibilityKernel => PolygonVisibilityKernel_EEK.Instance;\n\n internal override ArrangementKernel2 ArrangementKernel2 => ArrangementKernel2_EEK.Instance;\n\n internal override SweepLineKernel SweepLineKernel => SweepLineKernel_EEK.Instance;\n\n internal override TriangulationKernel2 TriangulationKernel2 => TriangulationKernel2_EEK.Instance;\n\n internal override TriangulationKernel3 TriangulationKernel3 => TriangulationKernel3_EEK.Instance;\n\n internal override DelaunayTriangulationKernel2 DelaunayTriangulationKernel2 => DelaunayTriangulationKernel2_EEK.Instance;\n\n internal override DelaunayTriangulationKernel3 DelaunayTriangulationKernel3 => DelaunayTriangulationKernel3_EEK.Instance;\n\n internal override ConstrainedTriangulationKernel2 ConstrainedTriangulationKernel2 => ConstrainedTriangulationKernel2_EEK.Instance;\n\n internal override ConstrainedDelaunayTriangulationKernel2 ConstrainedDelaunayTriangulationKernel2 => ConstrainedDelaunayTriangulationKernel2_EEK.Instance;\n\n internal override ConformingTriangulationKernel2 ConformingTriangulationKernel2 => ConformingTriangulationKernel2_EEK.Instance;\n\n internal override ConvexHullKernel2 ConvexHullKernel2 => ConvexHullKernel2_EEK.Instance;\n\n internal override ConvexHullKernel3 ConvexHullKernel3 => ConvexHullKernel3_EEK.Instance;\n\n internal override PolyhedronKernel3 PolyhedronKernel3 => PolyhedronKernel3_EEK.Instance;\n\n internal override NefPolyhedronKernel3 NefPolyhedronKernel3 => NefPolyhedronKernel3_EEK.Instance;\n\n internal override SurfaceMeshKernel3 SurfaceMeshKernel3 => SurfaceMeshKernel3_EEK.Instance;\n\n internal override TetrahedralRemeshingKernel TetrahedralRemeshingKernel => TetrahedralRemeshingKernel_EEK.Instance;\n\n internal override SurfaceSubdivisionKernel SurfaceSubdivisionKernel => SurfaceSubdivisionKernel_EEK.Instance;\n\n internal override SurfaceSimplificationKernel SurfaceSimplificationKernel => throw new NotSupportedException();\n\n internal override SkinSurfaceMeshingKernel SkinSurfaceMeshingKernel => SkinSurfaceMeshingKernel_EEK.Instance;\n\n internal override MeshProcessingMeshingKernel MeshProcessingMeshingKernel => MeshProcessingMeshingKernel_EEK.Instance;\n\n internal override MeshProcessingRepairKernel MeshProcessingRepairKernel => MeshProcessingRepairKernel_EEK.Instance;\n\n internal override MeshProcessingOrientationKernel MeshProcessingOrientationKernel => MeshProcessingOrientationKernel_EEK.Instance;\n\n internal override MeshProcessingBooleanKernel MeshProcessingBooleanKernel => MeshProcessingBooleanKernel_EEK.Instance;\n\n internal override MeshProcessingConnectionsKernel MeshProcessingConnectionsKernel => MeshProcessingConnectionsKernel_EEK.Instance;\n\n internal override MeshProcessingSlicerKernel MeshProcessingSlicerKernel => MeshProcessingSlicerKernel_EEK.Instance;\n\n internal override MeshProcessingFeaturesKernel MeshProcessingFeaturesKernel => MeshProcessingFeaturesKernel_EEK.Instance;\n\n internal override MeshProcessingLocateKernel MeshProcessingLocateKernel => MeshProcessingLocateKernel_EEK.Instance;\n\n internal override HeatMethodKernel HeatMethodKernel => HeatMethodKernel_EEK.Instance;\n }\n\n}\n"
},
{
"path": "CGALDotNet/CGALObject.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing System.Runtime.InteropServices;\n\nnamespace CGALDotNet\n{\n /// \n /// Base class for objects that referrence a CGAL object.\n /// \n public abstract class CGALObject : IDisposable\n {\n protected const string DLL_NAME = \"CGALWrapper.dll\";\n\n protected const CallingConvention CDECL = CallingConvention.Cdecl;\n\n /// \n /// The pointer to the unmanged CGAL object.\n /// \n private IntPtr m_ptr;\n\n /// \n /// Default constructor.\n /// \n internal CGALObject()\n {\n m_ptr = IntPtr.Zero;\n }\n\n /// \n /// Constructor taking a referrence to a CGAL object.\n /// \n /// A pointer to a CGAL object.\n internal CGALObject(IntPtr ptr)\n {\n m_ptr = ptr;\n }\n\n /// \n /// The destuctor.\n /// \n ~CGALObject()\n {\n Release();\n }\n\n /// \n /// Has the object been disposed.\n /// \n public bool IsDisposed { get; private set; }\n\n /// \n /// Get the ptr to the CGAL object.\n /// \n internal IntPtr Ptr \n { \n get\n {\n CheckPtr();\n return m_ptr;\n }\n private protected set\n {\n m_ptr = value;\n }\n }\n\n /// \n /// Dispose the CGAL object.\n /// \n public void Dispose()\n {\n Release();\n GC.SuppressFinalize(this);\n }\n\n /// \n /// Print some information about the object.\n /// \n /// Print some information about the object.\n public override string ToString()\n {\n return String.Format(\"[CGALObject: Ptr={0}, IsDiposed={1}]\", Ptr.ToInt64(), IsDisposed);\n }\n\n /// \n /// Print the object into the console.\n /// \n public void Print()\n {\n var buider = new StringBuilder();\n Print(buider);\n Console.WriteLine(buider.ToString());\n }\n\n /// \n /// Print the object into a string builder.\n /// \n /// The builder to print into.\n public virtual void Print(StringBuilder builder)\n {\n builder.AppendLine(ToString());\n }\n\n /// \n /// Release the CGAL object.\n /// \n private void Release()\n {\n if (!IsDisposed)\n {\n if(m_ptr != IntPtr.Zero)\n ReleasePtr();\n\n m_ptr = IntPtr.Zero;\n IsDisposed = true;\n }\n }\n\n /// \n /// Swap the unmanaged pointer with another.\n /// The old ptr will be released first.\n /// \n /// The new ptr. The old ptr will be released first.\n internal void Swap(IntPtr ptr)\n {\n if(IsDisposed)\n throw new CGALUnmanagedResourcesReleasedExeception(\"Can not swap when object has beed disposed.\");\n\n if (m_ptr != IntPtr.Zero)\n ReleasePtr(Ptr);\n\n Ptr = ptr;\n }\n\n /// \n /// Allow derived class to release the unmanaged memory.\n /// \n protected abstract void ReleasePtr();\n\n /// \n /// Allow derived class to release the unmanaged memory.\n /// \n protected virtual void ReleasePtr(IntPtr ptr)\n {\n throw new CGALUnmanagedResourcesNotReleasedExeception(\"ReleasePtr not implemented.\");\n }\n\n /// \n /// Check if the object is still valid.\n /// \n protected void CheckPtr()\n {\n if(IsDisposed)\n throw new CGALUnmanagedResourcesReleasedExeception(\"Unmanaged resources have been released.\");\n\n if (m_ptr == IntPtr.Zero)\n throw new CGALUnmanagedResourcesReleasedExeception(\"Unmanaged resources have not been created.\");\n }\n }\n}\n"
},
{
"path": "CGALDotNet/CGALObjectKernel.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing System.Runtime.InteropServices;\n\nnamespace CGALDotNet\n{\n internal abstract class CGALObjectKernel\n {\n protected const string DLL_NAME = \"CGALWrapper.dll\";\n\n protected const CallingConvention CDECL = CallingConvention.Cdecl;\n\n internal abstract string Name { get; }\n\n }\n}\n"
},
{
"path": "CGALDotNet/Collections/NativeList.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\nusing System.Collections;\n\nnamespace CGALDotNet.Collections\n{\n\t/// \n\t/// \n\t/// \n\t/// \n\tpublic sealed class NativeList : NativeList, IList, IEnumerable where T : CGALObject, new()\n {\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tprivate List m_list;\n\n\t\t/// \n\t\t/// \n\t\t/// \n public NativeList() : base()\n\t\t{\n\t\t\tm_list = new List();\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic NativeList(int count) : base(count)\n\t\t{\n\t\t\tm_list = new List(count);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tinternal NativeList(IntPtr ptr) : base(ptr)\n\t\t{\n\t\t\tfor(int i = 0; i < Count; i++)\n {\n\t\t\t\tvar p = NativeList_Get(Ptr, i);\n\t\t\t\tvar item = new T();\n\t\t\t\titem.Swap(p);\n\t\t\t\tm_list.Add(item);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool IsSync => Count == m_list.Count;\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n public override string ToString()\n {\n return String.Format(\"[NativeList: Count={0}, Capacity={1}, IsSync={2}]\", Count, Capacity, IsSync);\n }\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic IEnumerator GetEnumerator()\n\t\t{\n\t\t\tfor (int i = 0; i < Count; i++)\n\t\t\t\tyield return m_list[i];\n\t\t}\n\n\t\tIEnumerator IEnumerable.GetEnumerator()\n\t\t{\n\t\t\treturn GetEnumerator();\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic T this[int i]\n\t\t{\n\t\t\tget => Get(i);\n\t\t\tset => Set(i, value);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void Clear()\n\t\t{\n\t\t\tm_list.Clear();\n\t\t\tNativeList_Clear(Ptr);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void Add(T item)\n\t\t{\n\t\t\tm_list.Add(item);\n\t\t\tNativeList_Add(Ptr, item.Ptr);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void AddRange(IEnumerable items)\n\t\t{\n\t\t\tforeach(var item in items)\n\t\t\t\tAdd(item);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic NativeList Copy()\n {\n\t\t\tvar ptr = NativeList_Copy(Ptr);\n\t\t\treturn new NativeList(ptr);\n }\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void CopyTo(T[] array, int startIndex)\n\t\t{\n\t\t\tfor (int i = startIndex; i < Count; i++)\n\t\t\t\tarray[i] = Get(i);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool Contains(T item)\n\t\t{\n\t\t\treturn m_list.Contains(item);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic int IndexOf(T item)\n\t\t{\n\t\t\treturn m_list.IndexOf(item);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void Insert(int index, T item)\n\t\t{\n\t\t\tm_list.Insert(index, item);\n\t\t\tNativeList_Insert(Ptr, item.Ptr, index);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool Remove(T item)\n\t\t{\n\t\t\tvar b1 = m_list.Remove(item);\n\t\t\tvar b2 = NativeList_Remove(Ptr, item.Ptr);\n\n\t\t\treturn b1 && b2;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void RemoveAt(int index)\n\t\t{\n\t\t\tm_list.RemoveAt(index);\n\t\t\tNativeList_RemoveAt(Ptr, index);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void Reverse()\n\t\t{\n\t\t\tm_list.Reverse();\n\t\t\tNativeList_Reverse(Ptr);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void TrimExcess()\n\t\t{\n\t\t\tm_list.TrimExcess();\n\t\t\tNativeList_TrimExcess(Ptr);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tprivate T Get(int index)\n\t\t{\n\t\t\treturn m_list[index];\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tprivate void Set(int index, T item)\n\t\t{\n\t\t\tm_list[index] = item;\n\t\t\tNativeList_Set(Ptr, index, item.Ptr);\n\t\t}\n }\n\n\t/// \n\t/// \n\t/// \n\tpublic abstract class NativeList : CGALObject\n\t{\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic NativeList()\n\t\t{\n\t\t\tPtr = NativeList_Create();\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic NativeList(int count)\n\t\t{\n\t\t\tPtr = NativeList_CreateWithCount(count);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tinternal NativeList(IntPtr ptr)\n\t\t{\n\t\t\tPtr = ptr;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic int Capacity => NativeList_Capacity(Ptr);\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic int Count => NativeList_Count(Ptr);\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool IsReadOnly => false;\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tprotected override void ReleasePtr()\n\t\t{\n\t\t\tNativeList_Release(Ptr);\n\t\t}\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern IntPtr NativeList_Create();\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern IntPtr NativeList_CreateWithCount(int count);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_Release(IntPtr listPtr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_Add(IntPtr listPtr, IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_AddRange(IntPtr listPtr, IntPtr[] ptr_array, int count);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern int NativeList_Capacity(IntPtr listPtr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_Clear(IntPtr listPtr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern int NativeList_Count(IntPtr listPtr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern bool NativeList_Contains(IntPtr listPtr, IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern IntPtr NativeList_Copy(IntPtr listPtr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern IntPtr NativeList_Get(IntPtr listPtr, int index);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_Set(IntPtr listPtr, int index, IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern int NativeList_IndexOf(IntPtr listPtr, IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_Insert(IntPtr listPtr, IntPtr ptr, int index);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern bool NativeList_Remove(IntPtr listPtr, IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_RemoveAt(IntPtr listPtr, int index);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_Reverse(IntPtr listPtr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprotected static extern void NativeList_TrimExcess(IntPtr listPtr);\n\t}\n}\n"
},
{
"path": "CGALDotNet/Eigen/EigenColumnVector.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Eigen\n{\n /// \n /// \n /// \n public class EigenColumnVector : EigenVector\n {\n /// \n /// \n /// \n /// \n public EigenColumnVector(int dimension)\n {\n Ptr = EigenColumnVector_CreateVector(dimension);\n }\n\n /// \n /// \n /// \n /// \n /// \n public EigenColumnVector(double x, double y)\n {\n Ptr = EigenColumnVector_CreateVector(2);\n this[0] = x;\n this[1] = y;\n }\n\n /// \n /// \n /// \n /// \n /// \n /// \n public EigenColumnVector(double x, double y, double z)\n {\n Ptr = EigenColumnVector_CreateVector(3);\n this[0] = x;\n this[1] = y;\n this[2] = z;\n }\n\n /// \n /// \n /// \n /// \n /// \n /// \n /// \n public EigenColumnVector(double x, double y, double z, double w)\n {\n Ptr = EigenColumnVector_CreateVector(4);\n this[0] = x;\n this[1] = y;\n this[2] = z;\n this[3] = w;\n }\n\n /// \n /// \n /// \n /// \n public EigenColumnVector(IList list)\n {\n Ptr = EigenColumnVector_CreateVector(list.Count);\n for (int i = 0; i < list.Count; i++)\n this[i] = list[i];\n }\n\n /// \n /// \n /// \n /// \n internal EigenColumnVector(IntPtr ptr) : base(ptr)\n {\n\n }\n\n /// \n /// \n /// \n /// \n /// \n public override double this[int i]\n {\n get { return EigenColumnVector_Get(Ptr, i); }\n set { EigenColumnVector_Set(Ptr, i, value); }\n }\n\n /// \n /// \n /// \n public override int Dimension => EigenColumnVector_Dimension(Ptr);\n\n /// \n /// \n /// \n public override double Magnitude => EigenColumnVector_Norm(Ptr);\n\n /// \n /// \n /// \n /// \n public override string ToString()\n {\n return String.Format(\"[EigenColumnVector: Dimension={0}]\", Dimension);\n }\n\n /// \n /// \n /// \n public EigenColumnVector Normalized => new EigenColumnVector(EigenColumnVector_Normalized(Ptr));\n\n /// \n /// \n /// \n public EigenRowVector Transpose => new EigenRowVector(EigenColumnVector_Transpose(Ptr));\n\n /// \n /// \n /// \n public EigenColumnVector Adjoint => new EigenColumnVector(EigenColumnVector_Adjoint(Ptr));\n\n /// \n /// \n /// \n public EigenColumnVector Conjugate => new EigenColumnVector(EigenColumnVector_Conjugate(Ptr));\n\n /// \n /// \n /// \n /// \n /// \n /// \n public static double Dot(EigenColumnVector v1, EigenColumnVector v2)\n {\n AreSameSize(v1, v2);\n return EigenColumnVector_Dot(v1.Ptr, v2.Ptr);\n }\n\n /// \n /// \n /// \n public override void Normalize()\n {\n EigenColumnVector_Normalize(Ptr);\n }\n\n /// \n /// \n /// \n /// \n public override void Resize(int dimension)\n {\n EigenColumnVector_Resize(Ptr, dimension);\n }\n\n /// \n /// \n /// \n /// \n /// \n /// \n /// \n /// \n public static EigenColumnVector Random(int dimension, double min, double max, int seed)\n {\n var ptr = EigenColumnVector_CreateVector(dimension);\n var v = new EigenColumnVector(ptr);\n var rnd = new Random(seed);\n double range = max - min;\n\n for (int i = 0; i < v.Dimension; i++)\n v[i] = min + rnd.NextDouble() * range;\n\n return v;\n }\n\n /// \n /// \n /// \n protected override void ReleasePtr()\n {\n EigenColumnVector_Release(Ptr);\n }\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenColumnVector_CreateVector(int dimension);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenColumnVector_Release(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int EigenColumnVector_Rows(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int EigenColumnVector_Dimension(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double EigenColumnVector_Get(IntPtr ptr, int x);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenColumnVector_Set(IntPtr ptr, int x, double value);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double EigenColumnVector_Dot(IntPtr ptr1, IntPtr ptr2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenColumnVector_Normalized(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenColumnVector_Normalize(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double EigenColumnVector_Norm(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenColumnVector_Transpose(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenColumnVector_Adjoint(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenColumnVector_Conjugate(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenColumnVector_Resize(IntPtr ptr, int dimension);\n }\n}\n"
},
{
"path": "CGALDotNet/Eigen/EigenMatrix.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Eigen\n{\n\t/// \n\t/// enum for egien solvers.\n\t/// \n\tpublic enum EIGEN_SOLVER\n {\n\t\tCOL_PIV_HOUSEHOLDER_QR,\n\t\tPARTIAL_PIV_LU,\n\t\tFULL_PIV_LU,\n\t\tHOUSEHOLDER_QR,\n\t\tLLT,\n\t\tLDLT,\n\t\tBDCSVD,\n\t\tJACOBI_SVD,\n\t\tFULL_PIV_HOUSEHOLDER_QR,\n\t\tCOMPLETE_ORTH_DECOM\n\t}\n\n\tpublic enum EIGEN_SOLVER_OPTIONS\n\t{\n\t\tCOMPUTE_FULL_U = 4, //Used to indicate that the square matrix U is to be computed.\n\t\tCOMPUTE_THIN_U = 8, //Used to indicate that the thin matrix U is to be computed.\n\t\tCOMPUTE_FULL_V = 16, //Used to indicate that the square matrix V is to be computed.\n\t\tCOMPUTE_THIN_V = 32, //Used to indicate that the thin matrix V is to be computed.\n\t}\n\n\tpublic class EigenMatrix : CGALObject\n\t{\n\t\t/// \n\t\t/// Create a new matrix filled with zeros.\n\t\t/// \n\t\t/// The number of rows.\n\t\t/// The number of columns.\n\t\tpublic EigenMatrix(int rows, int columns)\n\t\t{\n\t\t\tif (rows <= 0)\n\t\t\t\tthrow new ArgumentException(\"Row vectors count can not be <= zero.\");\n\n\t\t\tif (columns <= 0)\n\t\t\t\tthrow new ArgumentException(\"Column vectors count can not be <= zero.\");\n\n\t\t\tPtr = EigenMatrix_Create(rows, columns);\n\t\t}\n\n\t\t/// \n\t\t/// Create a new matrix fill with the array contents.\n\t\t/// \n\t\t/// The array.\n\t\tpublic EigenMatrix(double[,] array)\n\t\t{\n\t\t\tint rowsCount = array.GetLength(0);\n\t\t\tint columnsCount = array.GetLength(1);\n\n\t\t\tif (rowsCount == 0)\n\t\t\t\tthrow new ArgumentException(\"Row vectors count can not be zero.\");\n\n\t\t\tif (columnsCount == 0)\n\t\t\t\tthrow new ArgumentException(\"Column vectors count can not be zero.\");\n\n\t\t\tPtr = EigenMatrix_Create(rowsCount, columnsCount);\n\n\t\t\tfor (int i = 0; i < rowsCount; i++)\n\t\t\t{\n\t\t\t\tfor (int j = 0; j < columnsCount; j++)\n\t\t\t\t{\n\t\t\t\t\tthis[i, j] = array[i, j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// Create a new matrix filled with the contents of the column vectors.\n\t\t/// All column vectors must have the same dimension.\n\t\t/// \n\t\t/// \n\t\tpublic EigenMatrix(IList columns)\n\t\t{\n\t\t\tif (columns.Count == 0)\n\t\t\t\tthrow new ArgumentException(\"Column vectors count can not be zero.\");\n\n\t\t\tint rowsCount = columns.Count;\n\t\t\tint columnsCount = columns[0].Dimension;\n\t\t\tPtr = EigenMatrix_Create(rowsCount, columnsCount);\n\n\t\t\tfor (int i = 0; i < rowsCount; i++)\n\t\t\t{\n\t\t\t\tif (columns[i].Dimension != columnsCount)\n\t\t\t\t\tthrow new ArgumentException(\"Column vector is not the same size as fisrt column vector.\");\n\n\t\t\t\tfor (int j = 0; j < columnsCount; j++)\n\t\t\t\t{\n\t\t\t\t\tthis[i, j] = columns[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// Create a 2 x 2 matrix.\n\t\t/// \n\t\tpublic EigenMatrix(double m00, double m01,\n\t\t\t\t\t\tdouble m10, double m11)\n\t\t{\n\t\t\tPtr = EigenMatrix_Create(2, 2);\n\n\t\t\tthis[0, 0] = m00; this[0, 1] = m01;\n\t\t\tthis[1, 0] = m10; this[1, 1] = m11;\n\t\t}\n\n\t\t/// \n\t\t/// Create a 3 x 3 matrix.\n\t\t/// \n\t\tpublic EigenMatrix(double m00, double m01, double m02,\n\t\t\t\t\t\t\tdouble m10, double m11, double m12,\n\t\t\t\t\t\t\tdouble m20, double m21, double m22)\n\t\t{\n\t\t\tPtr = EigenMatrix_Create(3, 3);\n\n\t\t\tthis[0, 0] = m00; this[0, 1] = m01; this[0, 2] = m02;\n\t\t\tthis[1, 0] = m10; this[1, 1] = m11; this[1, 2] = m12;\n\t\t\tthis[2, 0] = m20; this[2, 1] = m21; this[2, 2] = m22;\n;\n\t\t}\n\n\t\t/// \n\t\t/// Create a 4 x 4 matrix.\n\t\t/// \n\t\tpublic EigenMatrix(\tdouble m00, double m01, double m02, double m03,\n\t\t\t\t\t\t\tdouble m10, double m11, double m12, double m13,\n\t\t\t\t\t\t\tdouble m20, double m21, double m22, double m23,\n\t\t\t\t\t\t\tdouble m30, double m31, double m32, double m33)\n\t\t{\n\t\t\tPtr = EigenMatrix_Create(4, 4);\n\n\t\t\tthis[0,0] = m00; this[0,1] = m01; this[0,2] = m02; this[0,3] = m03;\n\t\t\tthis[1,0] = m10; this[1,1] = m11; this[1,2] = m12; this[1,3] = m13;\n\t\t\tthis[2,0] = m20; this[2,1] = m21; this[2,2] = m22; this[2,3] = m23;\n\t\t\tthis[3,0] = m30; this[3,1] = m31; this[3,2] = m32; this[3,3] = m33;\n\t\t}\n\n\t\t/// \n\t\t/// Create a new matrix from a pointer.\n\t\t/// \n\t\t/// \n\t\tinternal EigenMatrix(IntPtr ptr) : base(ptr)\n\t\t{\n\n\t\t}\n\n\t\t/// \n\t\t/// Create a identity matrix.\n\t\t/// \n\t\t/// The number of rows and columns of the matrix. Must be square.\n\t\t/// The identity matrix.\n\t\tpublic static EigenMatrix Identity(int size)\n\t\t{\n\t\t\tif (size <= 0)\n\t\t\t\tthrow new ArgumentException(\"Size can not be <= zero.\");\n\n\t\t\tvar ptr = EigenMatrix_CreateIdentity(size, size);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\t/// \n\t\t/// Create a matrix filled with the numbers 1, 2. 3, etc to end.\n\t\t/// Used for debugging.\n\t\t/// \n\t\t/// The number of rows.\n\t\t/// The number columns.\n\t\t/// The Matrix.\n\t\t/// \n\t\tinternal static EigenMatrix Series(int rows, int columns)\n\t\t{\n\t\t\tif (rows <= 0)\n\t\t\t\tthrow new ArgumentException(\"Rows can not be <= zero.\");\n\n\t\t\tif (columns <= 0)\n\t\t\t\tthrow new ArgumentException(\"Colums can not be <= zero.\");\n\n\t\t\tvar m = new EigenMatrix(rows, columns);\n\n\t\t\tint i = 0;\n\t\t\tfor (int x = 0; x < m.Rows; x++)\n\t\t\t{\n\t\t\t\tfor (int y = 0; y < m.Columns; y++)\n\t\t\t\t{\n\t\t\t\t\tm[x, y] = i++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn m;\n\t\t}\n\n\t\t/// \n\t\t/// Create a new matrix fill with random numbers.\n\t\t/// \n\t\t/// The number of rows.\n\t\t/// The number columns.\n\t\t/// The minimum random number generated.\n\t\t/// The maximum random number generated.\n\t\t/// The random generators seed.\n\t\t/// The matrix.\n\t\tpublic static EigenMatrix Random(int rows, int columns, double min, double max, int seed)\n\t\t{\n\t\t\tvar m = new EigenMatrix(rows, columns);\n\t\t\tvar rnd = new Random(seed);\n\t\t\tdouble range = max - min;\n\n\t\t\tfor (int i = 0; i < m.Length; i++)\n\t\t\t\tm[i] = min + rnd.NextDouble() * range;\n\n\t\t\treturn m;\n\t\t}\n\n\t\t/// \n\t\t/// The number of rows in the matrix.\n\t\t/// \n\t\tpublic int Rows => EigenMatrix_Rows(Ptr);\n\n\t\t/// \n\t\t/// The number of columns in the matrix.\n\t\t/// \n\t\tpublic int Columns => EigenMatrix_Columns(Ptr);\n\n\t\t/// \n\t\t/// The total size of the matrix which is \n\t\t/// the rows times the number of columns.\n\t\t/// \n\t\tpublic int Length => Rows * Columns;\n\n\t\t/// \n\t\t/// The single dimension array accessor.\n\t\t/// \n\t\t/// The array index.\n\t\t/// The value at the index i.\n\t\tpublic double this[int i]\n\t\t{\n\t\t\tget { return EigenMatrix_GetX(Ptr, i); }\n\t\t\tset { EigenMatrix_SetX(Ptr, i, value); }\n\t\t}\n\n\t\t/// \n\t\t/// The double dimension array accessor.\n\t\t/// \n\t\t/// The row index.\n\t\t/// The column index.\n\t\t/// The value at the index i,j.\n\t\tpublic double this[int i, int j]\n\t\t{\n\t\t\tget { return EigenMatrix_GetXY(Ptr, i, j); }\n\t\t\tset { EigenMatrix_SetXY(Ptr, i, j, value); }\n\t\t}\n\n\t\t/// \n\t\t/// The matrix string info.\n\t\t/// \n\t\t/// The matrix string info.\n\t\tpublic override string ToString()\n\t\t{\n\t\t\treturn String.Format(\"[EigenMatrix: Rows={0}, Columns={1}]\", Rows, Columns);\n\t\t}\n\n\t\t/// \n\t\t/// The matrix transposed.\n\t\t/// Flips a matrix over its diagonal that is, \n\t\t/// it switches the row and column indices of the matrix.\n\t\t/// \n\t\tpublic EigenMatrix Transpose\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tvar ptr = EigenMatrix_Transpose(Ptr);\n\t\t\t\treturn new EigenMatrix(ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// The matrices conjugate.\n\t\t/// The matrix obtained by replacing each element a(ij) with its complex conjugate, A^=(a^(ij)).\n\t\t/// \n\t\tpublic EigenMatrix Conjugate\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tvar ptr = EigenMatrix_Conjugate(Ptr);\n\t\t\t\treturn new EigenMatrix(ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// The matrices adjoint.\n\t\t/// The transpose of its cofactor matrix.\n\t\t/// \n\t\tpublic EigenMatrix Adjoint\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tvar ptr = EigenMatrix_Adjoint(Ptr);\n\t\t\t\treturn new EigenMatrix(ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// Is the matrix invertible.\n\t\t/// \n\t\tpublic bool IsInvertible\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tif(IsSquare) return false;\n\t\t\t\treturn EigenMatrix_IsInvertible(Ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// The inverse of a square matrix A, \n\t\t/// sometimes called a reciprocal matrix, \n\t\t/// is a matrix A^(-1) such that AA^(-1)=I.\n\t\t/// DOes not check if the matrix is invertible.\n\t\t/// \n\t\tpublic EigenMatrix Inverse\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tCheckIfSqaure(this);\n\t\t\t\tvar ptr = EigenMatrix_Inverse(Ptr);\n\t\t\t\treturn new EigenMatrix(ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// The determinant is a scalar value that is a \n\t\t/// function of the entries of a square matrix.\n\t\t/// \n\t\tpublic double Determinant\n\t\t{\n\t\t\tget\n\t\t\t{\n\t\t\t\tCheckIfSqaure(this);\n\t\t\t\treturn EigenMatrix_Determinant(Ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// The trace of a square matrix is defined to be the \n\t\t/// sum of elements on the main diagonal from the upper left to the lower right.\n\t\t/// \n\t\tpublic double Trace\n {\n\t\t\tget\n\t\t\t{\n\t\t\t\tCheckIfSqaure(this);\n\t\t\t\treturn EigenMatrix_Trace(Ptr);\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// A square matrix has the same number of rows and columns.\n\t\t/// \n\t\tpublic bool IsSquare => Rows == Columns;\n\n\t\t/// \n\t\t/// A diagonal matrix is a matrix in which the entries \n\t\t/// outside the main diagonal are all zero.\n\t\t/// \n\t\tpublic bool IsDiagonal => EigenMatrix_IsDiagonal(Ptr);\n\n\t\t/// \n\t\t/// A square matrix is called upper triangular \n\t\t/// if all the entries below the main diagonal are zero.\n\t\t/// \n\t\tpublic bool IsUpperTriangular => EigenMatrix_IsUpperTriangular(Ptr);\n\n\t\t/// \n\t\t/// A square matrix is called lower triangular \n\t\t/// if all the entries above the main diagonal are zero.\n\t\t/// \n\t\tpublic bool IsLowerTriangular => EigenMatrix_IsLowerTriangular(Ptr);\n\n\t\t/// \n\t\t/// Multiple each component in matrix by the scalar.\n\t\t/// \n\t\t/// The matrix.\n\t\t/// The scalar.\n\t\t/// The matrix with each component multiplied by the scalar.\n\t\tpublic static EigenMatrix operator *(EigenMatrix m, double s)\n\t\t{\n\t\t\treturn new EigenMatrix(EigenMatrix_MulScalar(m.Ptr, s));\n\t\t}\n\n\t\t/// \n\t\t/// Divide each component in matrix by the scalar.\n\t\t/// \n\t\t/// The matrix.\n\t\t/// The scalar.\n\t\t/// The matrix with each component divided by the scalar.\n\t\tpublic static EigenMatrix operator /(EigenMatrix m, double s)\n\t\t{\n\t\t\treturn new EigenMatrix(EigenMatrix_DivideScalar(m.Ptr, s));\n\t\t}\n\n\t\t/// \n\t\t/// Multiple the two matrices.\n\t\t/// The first matrices number of columns must \n\t\t/// the same as the second matrices number of rows.\n\t\t/// \n\t\t/// The first matrix.\n\t\t/// The second matrix.\n\t\t/// The product matrix.\n\t\tpublic static EigenMatrix operator *(EigenMatrix m1, EigenMatrix m2)\n\t\t{\n\t\t\tIsValidProduct(m1, m2);\n\t\t\treturn new EigenMatrix(EigenMatrix_MulMatrix(m1.Ptr, m2.Ptr));\n\t\t}\n\n\t\t/// \n\t\t/// Add two matrices.\n\t\t/// The matrices must be the same size.\n\t\t/// \n\t\t/// The first matrix.\n\t\t/// The second matrix.\n\t\t/// A matrix where each compoent is the sum of the other two matrices.\n\t\tpublic static EigenMatrix operator +(EigenMatrix m1, EigenMatrix m2)\n\t\t{\n\t\t\tAreSameSize(m1, m2);\n\t\t\treturn new EigenMatrix(EigenMatrix_AddMatrix(m1.Ptr, m2.Ptr));\n\t\t}\n\n\t\t/// \n\t\t/// Subtract two matrices.\n\t\t/// The matrices must be the same size.\n\t\t/// \n\t\t/// The first matrix.\n\t\t/// The second matrix.\n\t\t/// A matrix where each compoent is the difference of the other two matrices.\n\t\tpublic static EigenMatrix operator -(EigenMatrix m1, EigenMatrix m2)\n\t\t{\n\t\t\tAreSameSize(m1, m2);\n\t\t\treturn new EigenMatrix(EigenMatrix_SubMatrix(m1.Ptr, m2.Ptr));\n\t\t}\n\n\t\t/// \n\t\t/// Multiple a matrix and a column vector.\n\t\t/// \n\t\t/// The matrix.\n\t\t/// The column vector.\n\t\t/// The product column vector.\n\t\tpublic static EigenColumnVector operator *(EigenMatrix m, EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(m, v);\n\t\t\treturn new EigenColumnVector(EigenMatrix_MulColumnVector(m.Ptr, v.Ptr));\n\t\t}\n\n\t\t/// \n\t\t/// Is this matrix the identity matrix.\n\t\t/// \n\t\t/// The threshold the values in the \n\t\t/// matrix can be to the expected value.\n\t\t/// Is this matrix the identity matrix.\n\t\tpublic bool IsIdentity(double eps = MathUtil.DEG_TO_RAD_64)\n\t\t{\n\t\t\tif (!IsSquare) return false;\n\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (x == y)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!MathUtil.IsOne(this[x, y], eps))\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!MathUtil.IsZero(this[x, y], eps))\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// Is this matrix filled with zeros.\n\t\t/// \n\t\t/// The threshold the values in the \n\t\t/// matrix can be to the expected value.\n\t\t/// Is this matrix filled with zeros.\n\t\tpublic bool IsZero(double eps = MathUtil.DEG_TO_RAD_64)\n\t\t{\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (!MathUtil.IsZero(this[x, y], eps))\n\t\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// Are all the values in this matrix positive.\n\t\t/// \n\t\t/// Are all the values in this matrix positive.\n\t\tpublic bool IsPositive()\n\t\t{\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (this[x, y] < 0)\n\t\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// Does the matrix have a component that is nan.\n\t\t/// \n\t\t/// Does the matrix have a component that is nan.\n\t\tpublic bool HasNAN()\n\t\t{\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (double.IsNaN(this[x, y]))\n\t\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn false;\n\t\t}\n\n\t\t/// \n\t\t/// Replaces all nan values in the matrix with 0.\n\t\t/// \n\t\tpublic void NoNAN()\n\t\t{\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (double.IsNaN(this[x, y]))\n\t\t\t\t\t\tthis[x, y] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// Are all the values in the matrix finite (non-infinite and non-nan).\n\t\t/// \n\t\t/// Are all the values in the matrix finite (non-infinite and non-nan).\n\t\tpublic bool IsFinite()\n\t\t{\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (!MathUtil.IsFinite(this[x, y]))\n\t\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// Replaces all infinite and nan values in matrix with 0.\n\t\t/// \n\t\tpublic void MakeFinite()\n\t\t{\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (!MathUtil.IsFinite(this[x, y]))\n\t\t\t\t\t\tthis[x, y] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// Are all the values in the matrix the same.\n\t\t/// \n\t\t/// The threshold the values in the \n\t\t/// matrix can be to the expected value.\n\t\t/// Are all the values in the matrix the same.\n\t\tpublic bool IsConst(double eps = MathUtil.EPS_64)\n\t\t{\n\t\t\tvar value = this[0];\n\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t{\n\t\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t\t{\n\t\t\t\t\tif (!MathUtil.AlmostEqual(this[x, y], value, eps))\n\t\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// Create a sub matrix from this matrix.\n\t\t/// \n\t\t/// The row to start at.\n\t\t/// THe column to start at.\n\t\t/// The number of rows.\n\t\t/// The number of columns.\n\t\t/// A sub matrix from this matrix.\n\t\tpublic EigenMatrix SubMatrix(int startRow, int startCol, int rows, int cols)\n\t\t{\n\t\t\tvar ptr = EigenMatrix_Block(Ptr, startRow, startCol, rows, cols);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\t/// \n\t\t/// Create a sub matrix from this matrix.\n\t\t/// \n\t\t/// The number of rows.\n\t\t/// The number of columns.\n\t\t/// A sub matrix from this matrix.\n\t\tpublic EigenMatrix SubMatrix(int rows, int cols)\n\t\t{\n\t\t\tvar ptr = EigenMatrix_Reshaped(Ptr, rows, cols);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\t/// \n\t\t/// Solve the linear system.\n\t\t/// \n\t\t/// The vector to solve.\n\t\t/// The solver type.\n\t\t/// The solution vector.\n\t\tpublic EigenColumnVector Solve(EigenColumnVector v, EIGEN_SOLVER solver = EIGEN_SOLVER.COL_PIV_HOUSEHOLDER_QR)\n\t\t{\n switch (solver)\n {\n case EIGEN_SOLVER.COL_PIV_HOUSEHOLDER_QR:\n\t\t\t\t\treturn ColPivHouseholderQr(v);\n case EIGEN_SOLVER.PARTIAL_PIV_LU:\n\t\t\t\t\treturn PartialPivLu(v);\n case EIGEN_SOLVER.FULL_PIV_LU:\n\t\t\t\t\treturn FullPivLu(v);\t\n case EIGEN_SOLVER.HOUSEHOLDER_QR:\n\t\t\t\t\treturn HouseholderQr(v);\t\n case EIGEN_SOLVER.LLT:\n\t\t\t\t\treturn LLT(v);\n case EIGEN_SOLVER.LDLT:\n\t\t\t\t\treturn LDLT(v);\n case EIGEN_SOLVER.BDCSVD:\n\t\t\t\t\treturn BdcSvd(v);\n case EIGEN_SOLVER.JACOBI_SVD:\n return JacobiSvd(v);\n\t\t\t\tcase EIGEN_SOLVER.FULL_PIV_HOUSEHOLDER_QR:\n\t\t\t\t\treturn FullPivHouseholderQR(v);\n\t\t\t\tcase EIGEN_SOLVER.COMPLETE_ORTH_DECOM:\n\t\t\t\t\treturn CompleteOrthogonalDecomposition(v);\n\t\t\t\tdefault:\n\t\t\t\t\treturn ColPivHouseholderQr(v);\n }\n }\n\n\t\t/// \n\t\t/// Solve the linear system.\n\t\t/// \n\t\t/// The vector to solve.\n\t\t/// The solver type.\n\t\t/// The solution vector.\n\t\tpublic EigenMatrix Solve(EigenMatrix v, EIGEN_SOLVER solver = EIGEN_SOLVER.COL_PIV_HOUSEHOLDER_QR)\n\t\t{\n\t\t\tswitch (solver)\n\t\t\t{\n\t\t\t\tcase EIGEN_SOLVER.COL_PIV_HOUSEHOLDER_QR:\n\t\t\t\t\treturn ColPivHouseholderQr(v);\n\t\t\t\tcase EIGEN_SOLVER.PARTIAL_PIV_LU:\n\t\t\t\t\treturn PartialPivLu(v);\n\t\t\t\tcase EIGEN_SOLVER.FULL_PIV_LU:\n\t\t\t\t\treturn FullPivLu(v);\n\t\t\t\tcase EIGEN_SOLVER.HOUSEHOLDER_QR:\n\t\t\t\t\treturn HouseholderQr(v);\n\t\t\t\tcase EIGEN_SOLVER.LLT:\n\t\t\t\t\treturn LLT(v);\n\t\t\t\tcase EIGEN_SOLVER.LDLT:\n\t\t\t\t\treturn LDLT(v);\n\t\t\t\tcase EIGEN_SOLVER.BDCSVD:\n\t\t\t\t\treturn BdcSvd(v);\n\t\t\t\tcase EIGEN_SOLVER.JACOBI_SVD:\n\t\t\t\t\treturn JacobiSvd(v);\n\t\t\t\tcase EIGEN_SOLVER.FULL_PIV_HOUSEHOLDER_QR:\n\t\t\t\t\treturn FullPivHouseholderQR(v);\n\t\t\t\tcase EIGEN_SOLVER.COMPLETE_ORTH_DECOM:\n\t\t\t\t\treturn CompleteOrthogonalDecomposition(v);\n\t\t\t\tdefault:\n\t\t\t\t\treturn ColPivHouseholderQr(v);\n\t\t\t}\n\t\t}\n\n\t\tpublic EigenColumnVector ColPivHouseholderQr(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_ColPivHouseholderQr_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix ColPivHouseholderQr(EigenMatrix m)\n\t\t{\n\t\t\tIsValidProduct(this, m);\n\t\t\tvar ptr = EigenMatrix_ColPivHouseholderQr_Mat(Ptr, m.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector PartialPivLu(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tif (!IsInvertible)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must be invertible for PartialPivLu solver.\");\n\n\t\t\tvar ptr = EigenMatrix_PartialPivLu_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix PartialPivLu(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tif (!IsInvertible)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must be invertible for PartialPivLu solver.\");\n\n\t\t\tvar ptr = EigenMatrix_PartialPivLu_Mat(Ptr, v.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector FullPivLu(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_FullPivLu_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix FullPivLu(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_FullPivLu_Mat(Ptr, v.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector HouseholderQr(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_HouseholderQr_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix HouseholderQr(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_HouseholderQr_Mat(Ptr, v.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector LLT(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tif (!IsPositive())\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must be positive for LLT solver.\");\n\n\t\t\tvar ptr = EigenMatrix_LLT_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix LLT(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tif (!IsPositive())\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must be positive for LLT solver.\");\n\n\t\t\tvar ptr = EigenMatrix_LLT_Mat(Ptr, v.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector LDLT(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_LDLT_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix LDLT(EigenMatrix m)\n\t\t{\n\t\t\tIsValidProduct(this, m);\n\t\t\tvar ptr = EigenMatrix_LDLT_Mat(Ptr, m.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector BdcSvd(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tint options = (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_U | \n\t\t\t\t\t\t (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_V;\n\n\t\t\tvar ptr = EigenMatrix_BdcSvd_Vec(Ptr, v.Ptr, options);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix BdcSvd(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tint options = (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_U |\n\t\t\t (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_V;\n\n\t\t\tvar ptr = EigenMatrix_BdcSvd_Mat(Ptr, v.Ptr, options);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector JacobiSvd(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tint options = (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_U |\n\t\t\t (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_V;\n\n\t\t\tvar ptr = EigenMatrix_JacobiSvd_Vec(Ptr, v.Ptr, options);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix JacobiSvd(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\n\t\t\tint options = (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_U |\n\t\t\t (int)EIGEN_SOLVER_OPTIONS.COMPUTE_THIN_V;\n\n\t\t\tvar ptr = EigenMatrix_JacobiSvd_Mat(Ptr, v.Ptr, options);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector FullPivHouseholderQR(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_FullPivHouseholderQr_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix FullPivHouseholderQR(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_FullPivHouseholderQr_Mat(Ptr, v.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\tpublic EigenColumnVector CompleteOrthogonalDecomposition(EigenColumnVector v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_CompleteOrthogonalDecomposition_Vec(Ptr, v.Ptr);\n\t\t\treturn new EigenColumnVector(ptr);\n\t\t}\n\n\t\tpublic EigenMatrix CompleteOrthogonalDecomposition(EigenMatrix v)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\tvar ptr = EigenMatrix_CompleteOrthogonalDecomposition_Mat(Ptr, v.Ptr);\n\t\t\treturn new EigenMatrix(ptr);\n\t\t}\n\n\t\t/// \n\t\t/// Find the relative error from the linear system.\n\t\t/// \n\t\t/// The vector that was solved.\n\t\t/// The vector that was the solution.\n\t\t/// The relative error.\n\t\tpublic double RelativeError(EigenColumnVector v, EigenColumnVector x)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\treturn EigenMatrix_RelativeError_Vec(Ptr, v.Ptr, x.Ptr);\n\t\t}\n\n\t\t/// \n\t\t/// Find the relative error from the linear system.\n\t\t/// \n\t\t/// The vector that was solved.\n\t\t/// The vector that was the solution.\n\t\t/// The relative error.\n\t\tpublic double RelativeError(EigenMatrix v, EigenMatrix x)\n\t\t{\n\t\t\tIsValidProduct(this, v);\n\t\t\treturn EigenMatrix_RelativeError_Mat(Ptr, v.Ptr, x.Ptr);\n\t\t}\n\n\t\t/// \n\t\t/// Find the eigen values of the matrix.\n\t\t/// \n\t\t/// The eigen values if found, null otherwise.\n\t\t/// True if the values could be determined.\n\t\tpublic bool EigenValues(out EigenColumnVector values)\n\t\t{\n\t\t\tvar ptr = EigenMatrix_Eigenvalues(Ptr);\n\t\t\tif (ptr != IntPtr.Zero)\n\t\t\t{\n\t\t\t\tvalues = new EigenColumnVector(ptr);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tvalues = null;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// Find the eigen vectors of the matrix.\n\t\t/// \n\t\t/// The eigen vectors if found, null otherwise.\n\t\t/// True if the vectors could be determined.\n\t\tpublic bool EigenVectors(out EigenMatrix vectors)\n\t\t{\n\t\t\tvar ptr = EigenMatrix_Eigenvectors(Ptr);\n\t\t\tif (ptr != IntPtr.Zero)\n\t\t\t{\n\t\t\t\tvectors = new EigenMatrix(ptr);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tvectors = null;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool EigenValuesAndVectors(out EigenColumnVector values, out EigenMatrix vectors)\n {\n\t\t\tIntPtr valuesPtr;\n\t\t\tIntPtr vectorsPtr;\n\n\t\t\tif (EigenMatrix_EigenValuesVectors(Ptr, out valuesPtr, out vectorsPtr))\n {\n\t\n\t\t\t\tvalues = new EigenColumnVector(valuesPtr);\n\t\t\t\tvectors = new EigenMatrix(vectorsPtr);\n\t\t\t\treturn true;\n\t\t\t}\n else\n {\n\t\t\t\tvalues = null;\n\t\t\t\tvectors = null;\n\t\t\t\treturn false;\n }\n\n }\n\n\t\t/// \n\t\t/// Try and find the inverse of the matrix.\n\t\t/// \n\t\t/// The inverse if found, null otherwise.\n\t\t/// True if the inverse was found.\n\t\tpublic bool TryInverse(out EigenMatrix inverse)\n {\n\t\t\tinverse = null;\n\t\t\tif(!IsSquare) return false;\n\n\t\t\tvar ptr = EigenMatrix_TryInverse(Ptr);\n\t\t\tif(ptr != IntPtr.Zero)\n {\n\t\t\t\tinverse = new EigenMatrix(ptr);\n\t\t\t\treturn true;\n }\n\t\t\telse\n {\n\t\t\t\treturn false;\n }\n }\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic EigenRowVector GetRow(int Row)\n\t\t{\n\t\t\tCheckRows(this, Row + 1);\n\t\t\tvar v = new EigenRowVector(Rows);\n\t\t\tfor (int i = 0; i < Rows; i++)\n\t\t\t\tv[i] = this[i, Row];\n\n\t\t\treturn v;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetRow(int Row, EigenRowVector v)\n\t\t{\n\t\t\tAreSameSize(this, v);\n\t\t\tfor (int i = 0; i < Rows; i++)\n\t\t\t\tthis[i, Row] = v[i];\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetRow(int row, double x, double y)\n\t\t{\n\t\t\tCheckSize(this, row + 1, 2);\n\t\t\tthis[row, 0] = x;\n\t\t\tthis[row, 1] = y;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetRow(int row, double x, double y, double z)\n\t\t{\n\t\t\tCheckSize(this, row + 1, 3);\n\t\t\tthis[row, 0] = x;\n\t\t\tthis[row, 1] = y;\n\t\t\tthis[row, 2] = z;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetRow(int row, double x, double y, double z, double w)\n\t\t{\n\t\t\tCheckSize(this, row + 1, 4);\n\t\t\tthis[row, 0] = x;\n\t\t\tthis[row, 1] = y;\n\t\t\tthis[row, 2] = z;\n\t\t\tthis[row, 3] = w;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic EigenColumnVector GetColumn(int Column)\n\t\t{\n\t\t\tCheckColumns(this, Column + 1);\n\t\t\tvar v = new EigenColumnVector(Columns);\n\t\t\tfor (int i = 0; i < Columns; i++)\n\t\t\t\tv[i] = this[Column, i];\n\n\t\t\treturn v;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetColumn(int Column, EigenColumnVector v)\n\t\t{\n\t\t\tAreSameSize(this, v);\n\t\t\tfor (int i = 0; i < Columns; i++)\n\t\t\t\tthis[Column, i] = v[i];\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetColumn(int column, double x, double y)\n\t\t{\n\t\t\tCheckSize(this, 2, column + 1);\n\t\t\tthis[0, column] = x;\n\t\t\tthis[1, column] = y;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetColumn(int column, double x, double y, double z)\n\t\t{\n\t\t\tCheckSize(this, 3, column + 1);\n\t\t\tthis[0, column] = x;\n\t\t\tthis[1, column] = y;\n\t\t\tthis[2, column] = z;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void SetColumn(int column, double x, double y, double z, double w)\n\t\t{\n\t\t\tCheckSize(this, 4, column + 1);\n\t\t\tthis[0, column] = x;\n\t\t\tthis[1, column] = y;\n\t\t\tthis[2, column] = z;\n\t\t\tthis[3, column] = w;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void Round(int digits)\n\t\t{\n\t\t\tfor (int i = 0; i < Length; i++)\n\t\t\t\tthis[i] = Math.Round(this[i], digits);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic static EigenMatrix Translate(Point3d point)\n {\n\t\t\tvar m = EigenMatrix.Identity(4);\n\t\t\tm.SetColumn(3, point.x, point.y, point.z, 1);\n\t\t\treturn m;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic static EigenMatrix Scale(Point3d point)\n\t\t{\n\t\t\tvar m = EigenMatrix.Identity(4);\n\n\t\t\tm[0, 0] = point.x;\n\t\t\tm[1, 1] = point.y;\n\t\t\tm[2, 2] = point.z;\n\n\t\t\treturn m;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tstatic public EigenMatrix Scale(double s)\n\t\t{\n\t\t\tvar m = EigenMatrix.Identity(4);\n\n\t\t\tm[0, 0] = s;\n\t\t\tm[1, 1] = s;\n\t\t\tm[2, 2] = s;\n\n\t\t\treturn m;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tstatic public EigenMatrix RotateX(Radian radian)\n\t\t{\n\t\t\tvar m = new EigenMatrix(4, 4);\n\n\t\t\tdouble ca = MathUtil.Cos(radian);\n\t\t\tdouble sa = MathUtil.Sin(radian);\n\n\t\t\treturn new EigenMatrix(\t1, 0, 0, 0,\n\t\t\t\t\t\t\t\t\t0, ca, -sa, 0,\n\t\t\t\t\t\t\t\t\t0, sa, ca, 0,\n\t\t\t\t\t\t\t\t\t0, 0, 0, 1);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tstatic public EigenMatrix RotateY(Radian radian)\n\t\t{\n\t\t\tvar m = new EigenMatrix(4, 4);\n\n\t\t\tdouble ca = MathUtil.Cos(radian);\n\t\t\tdouble sa = MathUtil.Sin(radian);\n\n\t\t\treturn new EigenMatrix(ca, 0, sa, 0,\n\t\t\t\t\t\t\t\t\t0, 1, 0, 0,\n\t\t\t\t\t\t\t\t\t-sa, 0, ca, 0,\n\t\t\t\t\t\t\t\t\t0, 0, 0, 1);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tstatic public EigenMatrix RotateZ(Radian radian)\n\t\t{\n\t\t\tvar m = new EigenMatrix(4, 4);\n\n\t\t\tdouble ca = MathUtil.Cos(radian);\n\t\t\tdouble sa = MathUtil.Sin(radian);\n\n\t\t\treturn new EigenMatrix(ca, -sa, 0, 0,\n\t\t\t\t\t\t\t\t\tsa, ca, 0, 0,\n\t\t\t\t\t\t\t\t\t0, 0, 1, 0,\n\t\t\t\t\t\t\t\t\t0, 0, 0, 1);\n\t\t}\n\n\t\t/// \n\t\t/// Create a rotation from a angle and the rotation axis.\n\t\t/// \n\t\t/// The rotation amount.\n\t\t/// The axis to rotate on.\n\t\t/// The rotation matrix.\n\t\tstatic public EigenMatrix Rotate(Radian radian, Vector3d axis)\n\t\t{\n\t\t\tvar m = EigenMatrix.Identity(4);\n\n\t\t\tdouble sinTheta = MathUtil.Sin(radian);\n\t\t\tdouble cosTheta = MathUtil.Cos(radian);\n\n\t\t\t// Compute rotation of first basis vector\n\t\t\tm[0, 0] = axis.x * axis.x + (1 - axis.x * axis.x) * cosTheta;\n\t\t\tm[0, 1] = axis.x * axis.y * (1 - cosTheta) - axis.z * sinTheta;\n\t\t\tm[0, 2] = axis.x * axis.z * (1 - cosTheta) + axis.y * sinTheta;\n\t\t\tm[0, 3] = 0;\n\n\t\t\t// Compute rotations of second and third basis vectors\n\t\t\tm[1, 0] = axis.x * axis.y * (1 - cosTheta) + axis.z * sinTheta;\n\t\t\tm[1, 1] = axis.y * axis.y + (1 - axis.y * axis.y) * cosTheta;\n\t\t\tm[1, 2] = axis.y * axis.z * (1 - cosTheta) - axis.x * sinTheta;\n\t\t\tm[1, 3] = 0;\n\n\t\t\tm[2, 0] = axis.x * axis.z * (1 - cosTheta) - axis.y * sinTheta;\n\t\t\tm[2, 1] = axis.y * axis.z * (1 - cosTheta) + axis.x * sinTheta;\n\t\t\tm[2, 2] = axis.z * axis.z + (1 - axis.z * axis.z) * cosTheta;\n\t\t\tm[2, 3] = 0;\n\n\t\t\treturn m;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic override void Print(StringBuilder builder)\n\t\t{\n\t\t\tbuilder.AppendLine(this.ToString());\n\n\t\t\tfor (int x = 0; x < Rows; x++)\n\t\t\t{\n\t\t\t\tfor (int y = 0; y < Columns; y++)\n\t\t\t\t{\n\t\t\t\t\tbuilder.Append(this[x, y].ToString());\n\n\t\t\t\t\tif (y != Columns - 1)\n\t\t\t\t\t\tbuilder.Append(\",\");\n\t\t\t\t}\n\n\t\t\t\tbuilder.AppendLine();\n\t\t\t}\n\t\t}\n\n\t\tinternal static void CheckIfSqaure(EigenMatrix m)\n\t\t{\n\t\t\tif (!m.IsSquare)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must be Square.\");\n\t\t}\n\n\t\tinternal static void IsValidProduct(EigenMatrix m, EigenColumnVector v)\n\t\t{\n\t\t\tif (v.Dimension != m.Columns)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must have same number of columns as vectors dimension.\");\n\t\t}\n\n\t\tinternal static void IsValidProduct(EigenMatrix m1, EigenMatrix m2)\n\t\t{\n\t\t\tif (m1.Columns != m2.Rows)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix1 must have same number of columns as matrix2 has rows.\");\n\t\t}\n\n\t\tinternal static void AreSameSize(EigenMatrix m1, EigenMatrix m2)\n\t\t{\n\t\t\tif (m1.Rows != m2.Rows)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix1 must be the same size as matrix2.\");\n\n\t\t\tif (m1.Columns != m2.Columns)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix1 must be the same size as matrix2.\");\n\t\t}\n\n\t\tinternal static void AreSameSize(EigenMatrix m, EigenRowVector v)\n\t\t{\n\t\t\tif (m.Rows != v.Dimension)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must have the same number of rows as vector dimension.\");\n\t\t}\n\n\t\tinternal static void AreSameSize(EigenMatrix m, EigenColumnVector v)\n\t\t{\n\t\t\tif (m.Columns != v.Dimension)\n\t\t\t\tthrow new InvalidOperationException(\"Matrix must have the same number of columns as vector dimension.\");\n\t\t}\n\n\t\tinternal static void CheckSize(EigenMatrix m, int rows, int columns)\n\t\t{\n\t\t\tif (rows > m.Rows)\n\t\t\t\tthrow new InvalidOperationException(String.Format(\"Matrix must have at least {0} rows.\", rows));\n\n\t\t\tif (columns > m.Columns)\n\t\t\t\tthrow new InvalidOperationException(String.Format(\"Matrix must have at least {0} columns.\", columns));\n\t\t}\n\n\t\tinternal static void CheckRows(EigenMatrix m, int rows)\n\t\t{\n\t\t\tif (rows > m.Rows)\n\t\t\t\tthrow new InvalidOperationException(String.Format(\"Matrix must have at least {0} rows.\", rows));\n\t\t}\n\n\t\tinternal static void CheckColumns(EigenMatrix m, int columns)\n\t\t{\n\t\t\tif (columns > m.Columns)\n\t\t\t\tthrow new InvalidOperationException(String.Format(\"Matrix must have at least {0} rows.\", columns));\n\t\t}\n\n\t\tprotected override void ReleasePtr()\n\t\t{\n\t\t\tEigenMatrix_Release(Ptr);\n\t\t}\n\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Create(int rows, int columns);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_CreateIdentity(int rows, int columns);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern void EigenMatrix_Release(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern int EigenMatrix_Rows(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern int EigenMatrix_Columns(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern double EigenMatrix_GetXY(IntPtr ptr, int x, int y);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern void EigenMatrix_SetXY(IntPtr ptr, int x, int y, double value);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern double EigenMatrix_GetX(IntPtr ptr, int x);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern void EigenMatrix_SetX(IntPtr ptr, int x, double value);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Transpose(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Conjugate(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Adjoint(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Inverse(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern double EigenMatrix_Determinant(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern double EigenMatrix_Trace(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern bool EigenMatrix_IsIdentity(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern bool EigenMatrix_IsDiagonal(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern bool EigenMatrix_IsUpperTriangular(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern bool EigenMatrix_IsLowerTriangular(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_MulScalar(IntPtr ptr1, double s);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_DivideScalar(IntPtr ptr1, double s);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_MulMatrix(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_AddMatrix(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_SubMatrix(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_MulColumnVector(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Block(IntPtr ptr, int startRox, int startCol, int blockRows, int blockCols);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Reshaped(IntPtr ptr, int rows, int cols);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_ColPivHouseholderQr_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_ColPivHouseholderQr_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_PartialPivLu_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_PartialPivLu_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_FullPivLu_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_FullPivLu_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_HouseholderQr_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_HouseholderQr_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_LLT_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_LLT_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_LDLT_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_LDLT_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_BdcSvd_Vec(IntPtr ptr1, IntPtr ptr2, int options);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_BdcSvd_Mat(IntPtr ptr1, IntPtr ptr2, int options);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_JacobiSvd_Vec(IntPtr ptr1, IntPtr ptr2, int options);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_JacobiSvd_Mat(IntPtr ptr1, IntPtr ptr2, int options);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_FullPivHouseholderQr_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_FullPivHouseholderQr_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_CompleteOrthogonalDecomposition_Vec(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_CompleteOrthogonalDecomposition_Mat(IntPtr ptr1, IntPtr ptr2);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern double EigenMatrix_RelativeError_Vec(IntPtr ptr1, IntPtr ptr2, IntPtr ptr3);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern double EigenMatrix_RelativeError_Mat(IntPtr ptr1, IntPtr ptr2, IntPtr ptr3);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Eigenvalues(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_Eigenvectors(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern bool EigenMatrix_EigenValuesVectors(IntPtr ptr, [Out] out IntPtr values, [Out] out IntPtr vectors);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern bool EigenMatrix_IsInvertible(IntPtr ptr);\n\n\t\t[DllImport(DLL_NAME, CallingConvention = CDECL)]\n\t\tprivate static extern IntPtr EigenMatrix_TryInverse(IntPtr ptr);\n }\n}\n"
},
{
"path": "CGALDotNet/Eigen/EigenRowVector.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Eigen\n{\n /// \n /// \n /// \n public class EigenRowVector : EigenVector\n {\n /// \n /// \n /// \n /// \n public EigenRowVector(int dimension)\n {\n Ptr = EigenRowVector_CreateVector(dimension);\n }\n\n /// \n /// \n /// \n /// \n /// \n public EigenRowVector(double x, double y)\n {\n Ptr = EigenRowVector_CreateVector(2);\n this[0] = x;\n this[1] = y;\n }\n\n public EigenRowVector(double x, double y, double z)\n {\n Ptr = EigenRowVector_CreateVector(3);\n this[0] = x;\n this[1] = y;\n this[2] = z;\n }\n\n /// \n /// \n /// \n /// \n /// \n /// \n /// \n public EigenRowVector(double x, double y, double z, double w)\n {\n Ptr = EigenRowVector_CreateVector(4);\n this[0] = x;\n this[1] = y;\n this[2] = z;\n this[3] = w;\n }\n\n /// \n /// \n /// \n /// \n public EigenRowVector(IList list)\n {\n Ptr = EigenRowVector_CreateVector(list.Count);\n for(int i = 0; i < list.Count; i++) \n this[i] = list[i];\n }\n\n /// \n /// \n /// \n /// \n internal EigenRowVector(IntPtr ptr) : base(ptr)\n {\n\n }\n\n /// \n /// \n /// \n /// \n /// \n public override double this[int i]\n {\n get { return EigenRowVector_Get(Ptr, i); }\n set { EigenRowVector_Set(Ptr, i, value); }\n }\n\n /// \n /// \n /// \n public override int Dimension => EigenRowVector_Dimension(Ptr);\n\n /// \n /// \n /// \n public override double Magnitude => EigenRowVector_Norm(Ptr);\n\n /// \n /// /\n /// \n /// \n public override string ToString()\n {\n return String.Format(\"[EigenRowVector: Dimension={0}]\", Dimension);\n }\n\n /// \n /// \n /// \n public EigenRowVector Normalized => new EigenRowVector(EigenRowVector_Normalized(Ptr));\n\n /// \n /// \n /// \n public EigenColumnVector Transpose => new EigenColumnVector(EigenRowVector_Transpose(Ptr));\n\n /// \n /// \n /// \n public EigenRowVector Adjoint => new EigenRowVector(EigenRowVector_Adjoint(Ptr));\n \n /// \n /// \n /// \n public EigenRowVector Conjugate => new EigenRowVector(EigenRowVector_Conjugate(Ptr));\n\n /// \n /// \n /// \n /// \n /// \n /// \n public static double Dot(EigenRowVector v1, EigenRowVector v2)\n {\n AreSameSize(v1, v2);\n return EigenRowVector_Dot(v1.Ptr, v2.Ptr);\n }\n\n /// \n /// \n /// \n public override void Normalize()\n {\n EigenRowVector_Normalize(Ptr);\n }\n\n public override void Resize(int dimension)\n {\n EigenRowVector_Resize(Ptr, dimension);\n }\n\n /// \n /// \n /// \n /// \n /// \n /// \n /// \n /// \n public static EigenRowVector Random(int dimension, double min, double max, int seed)\n {\n var ptr = EigenRowVector_CreateVector(dimension);\n var v = new EigenRowVector(ptr);\n var rnd = new Random(seed);\n double range = max - min;\n\n for (int i = 0; i < v.Dimension; i++)\n v[i] = min + rnd.NextDouble() * range;\n\n return v;\n }\n\n /// \n /// \n /// \n protected override void ReleasePtr()\n {\n EigenRowVector_Release(Ptr);\n }\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenRowVector_CreateVector(int dimension);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenRowVector_Release(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int EigenRowVector_Rows(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern int EigenRowVector_Dimension(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double EigenRowVector_Get(IntPtr ptr, int x);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenRowVector_Set(IntPtr ptr, int x, double value);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double EigenRowVector_Dot(IntPtr ptr1, IntPtr ptr2);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenRowVector_Normalized(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenRowVector_Normalize(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern double EigenRowVector_Norm(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenRowVector_Transpose(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenRowVector_Adjoint(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern IntPtr EigenRowVector_Conjugate(IntPtr ptr);\n\n [DllImport(DLL_NAME, CallingConvention = CDECL)]\n private static extern void EigenRowVector_Resize(IntPtr ptr, int dimension);\n }\n}\n"
},
{
"path": "CGALDotNet/Eigen/EigenVector.cs",
"content": "using System;\nusing System.Text;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Eigen\n{\n\t/// \n\t/// \n\t/// \n\tpublic abstract class EigenVector : CGALObject\n\t{\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tinternal EigenVector()\n\t\t{\n\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tinternal EigenVector(IntPtr ptr) : base(ptr)\n\t\t{\n\n\t\t}\n\n\t\t/// \n\t\t/// The first value in the vector.\n\t\t/// \n\t\tpublic double x\n {\n\t\t\tget { return this[0]; }\n\t\t\tset { this[0] = value; }\n }\n\n\t\t/// \n\t\t/// The second value in the vector.\n\t\t/// \n\t\tpublic double y\n\t\t{\n\t\t\tget { return this[1]; }\n\t\t\tset { this[1] = value; }\n\t\t}\n\n\t\t/// \n\t\t/// The third value in the vector.\n\t\t/// \n\t\tpublic double z\n\t\t{\n\t\t\tget { return this[2]; }\n\t\t\tset { this[2] = value; }\n\t\t}\n\n\t\t/// \n\t\t/// The fourth value in the vector.\n\t\t/// \n\t\tpublic double w\n\t\t{\n\t\t\tget { return this[3]; }\n\t\t\tset { this[3] = value; }\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic abstract double this[int i] { get; set; }\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic abstract int Dimension { get; }\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic abstract double Magnitude { get; }\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic abstract void Normalize();\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic abstract void Resize(int dimension);\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool IsZero(double eps = MathUtil.DEG_TO_RAD_64)\n\t\t{\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (!MathUtil.IsZero(this[x], eps))\n\t\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool IsPositive()\n\t\t{\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (this[x] < 0)\n\t\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool HasNAN()\n\t\t{\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (double.IsNaN(this[x]))\n\t\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void NoNAN()\n\t\t{\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (double.IsNaN(this[x]))\n\t\t\t\t\tthis[x] = 0;\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool IsFinite()\n\t\t{\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (!MathUtil.IsFinite(this[x]))\n\t\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void MakeFinite()\n\t\t{\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (!MathUtil.IsFinite(this[x]))\n\t\t\t\t\tthis[x] = 0;\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic bool IsConst(double eps = MathUtil.EPS_64)\n\t\t{\n\t\t\tvar value = this[0];\n\t\t\tfor (int x = 0; x < Dimension; x++)\n\t\t\t{\n\t\t\t\tif (!MathUtil.AlmostEqual(this[x], value, eps))\n\t\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic void Round(int digits)\n\t\t{\n\t\t\tfor (int i = 0; i < Dimension; i++)\n\t\t\t\tthis[i] = Math.Round(this[i], digits);\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tpublic override void Print(StringBuilder builder)\n\t\t{\n\t\t\tbuilder.AppendLine(this.ToString());\n\n\t\t\tif (this is EigenColumnVector)\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < Dimension; i++)\n\t\t\t\t{\n\t\t\t\t\tbuilder.Append(this[i].ToString());\n\t\t\t\t\tif (i != Dimension - 1)\n\t\t\t\t\t\tbuilder.AppendLine(\",\");\n\t\t\t\t\telse\n\t\t\t\t\t\tbuilder.AppendLine();\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < Dimension; i++)\n\t\t\t\t{\n\t\t\t\t\tbuilder.Append(this[i].ToString());\n\t\t\t\t\tif (i != Dimension - 1)\n\t\t\t\t\t\tbuilder.Append(\",\");\n\t\t\t\t\telse\n\t\t\t\t\t\tbuilder.AppendLine();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\t/// \n\t\tinternal static void AreSameSize(EigenVector v1, EigenVector v2)\n\t\t{\n\t\t\tif (v1.Dimension != v2.Dimension)\n\t\t\t\tthrow new InvalidOperationException(\"Vector1 must be the same size as Vector2.\");\n\t\t}\n\n\t}\n}\n"
},
{
"path": "CGALDotNet/Extensions/ArrayExtensions.cs",
"content": "using System;\nusing System.Collections.Generic;\n\nusing CGALDotNet.Triangulations;\n\nnamespace CGALDotNet.Extensions\n{\n public static class ArrayExtensions\n {\n public static void Round(this TriVertex2[] array, int digits)\n {\n if (digits < 0) return;\n for (int i = 0; i < array.Length; i++)\n {\n var p = array[i].Point;\n array[i].Point = p.Rounded(digits);\n }\n }\n\n public static void Round(this TriVertex3[] array, int digits)\n {\n if (digits < 0) return;\n for (int i = 0; i < array.Length; i++)\n {\n var p = array[i].Point;\n array[i].Point = p.Rounded(digits);\n } \n }\n\n }\n}\n"
},
{
"path": "CGALDotNet/Extensions/EnumExtensions.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nnamespace CGALDotNet.Extensions\n{\n public static class EnumExtensions\n {\n internal static bool ToBool(this BOOL_OR_UNDETERMINED e)\n {\n return e == BOOL_OR_UNDETERMINED.TRUE;\n }\n }\n}\n"
},
{
"path": "CGALDotNet/Extensions/PrimativeExtensions.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nnamespace CGALDotNet.Extensions\n{\n public static class PrimativeExtensions\n {\n internal static BOOL_OR_UNDETERMINED ToBoolOrUndetermined(this bool b)\n {\n return b ? BOOL_OR_UNDETERMINED.TRUE : BOOL_OR_UNDETERMINED.FALSE;\n }\n\n }\n}\n"
},
{
"path": "CGALDotNet/Geometry/Box2.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nusing CGALDotNet;\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Geometry\n{\n /// \n /// The generic Box wrapper for a CGAL object.\n /// \n /// The kernel type.\n public sealed class Box2 : Box2 where K : CGALKernel, new()\n {\n\n /// \n /// Create box from min and max values.\n /// \n /// The min x and y value.\n /// The max x and y value.\n public Box2(double min, double max) : \n base(new Point2d(min), new Point2d(max), new K())\n {\n\n }\n\n /// \n /// Create box from min and max points.\n /// \n /// The min point.\n /// The max point.\n public Box2(Point2d min, Point2d max) : \n base(min, max, new K())\n {\n\n }\n\n /// \n /// Create from a pointer.\n /// \n /// The iso rectangle pointer.\n internal Box2(IntPtr ptr) : base(new K(), ptr)\n {\n\n }\n\n /// \n /// The type of kernel object uses.\n /// \n public string KernelName => Kernel.Name;\n\n /// \n /// The iso rectangle as a string.\n /// \n /// The iso rectangle as a string.\n public override string ToString()\n {\n return string.Format(\"[Box2<{0}>: Min={1}, Max={2}]\", \n KernelName, Min, Max);\n }\n\n /// \n /// Translate the shape.\n /// \n /// The amount to translate.\n public void Translate(Point2d translation)\n {\n Kernel.Box2_Transform(Ptr, translation, 0, 1);\n }\n\n /// \n /// Rotate the shape.\n /// \n /// The amount to rotate.\n public void Rotate(Degree rotation)\n {\n Kernel.Box2_Transform(Ptr, Point2d.Zero, rotation.radian, 1);\n }\n\n /// \n /// Scale the shape.\n /// \n /// The amount to scale.\n public void Scale(double scale)\n {\n Kernel.Box2_Transform(Ptr, Point2d.Zero, 0, scale);\n }\n\n /// \n /// Transform the rectangle.\n /// \n /// The amount to translate.\n /// The amount to rotate\n /// The amount to scale.\n public void Transform(Point2d translation, Degree rotation, double scale)\n {\n Kernel.Box2_Transform(Ptr, translation, rotation.radian, scale);\n }\n\n /// \n /// Create a deep copy of the rectangle.\n /// \n /// The deep copy.\n public Box2 Copy()\n {\n var ptr = Kernel.Box2_Copy(Ptr);\n return new Box2(ptr);\n }\n\n }\n\n /// \n /// The abstract iso rectangle definition.\n /// \n public abstract class Box2 : CGALObject\n {\n\n /// \n /// Default constructor.\n /// \n private Box2()\n {\n\n }\n\n /// \n /// \n /// \n /// \n /// \n /// \n internal Box2(Point2d min, Point2d max, CGALKernel kernel)\n {\n Kernel = kernel.GeometryKernel2;\n Ptr = Kernel.Box2_Create(min, max);\n }\n\n /// \n /// Construct with a new kernel.\n /// \n /// The geometry kernel.\n /// The Box pointer.\n internal Box2(CGALKernel kernel, IntPtr ptr) : base(ptr)\n {\n Kernel = kernel.GeometryKernel2;\n }\n\n /// \n /// The iso rectangle kernel.\n /// Contains the functions to the unmanaged CGAL object.\n /// \n protected private GeometryKernel2 Kernel { get; private set; }\n\n /// \n /// Convert to shape struct.\n /// \n public Box2d Shape => new Box2d(Min, Max);\n\n /// \n /// The rectangles min point.\n /// \n public Point2d Min\n {\n get { return Kernel.Box2_GetMin(Ptr); }\n set { Kernel.Box2_SetMin(Ptr, value); }\n }\n\n /// \n /// The rectangles max point.\n /// \n public Point2d Max\n {\n get { return Kernel.Box2_GetMax(Ptr); }\n set { Kernel.Box2_SetMax(Ptr, value); }\n }\n\n /// \n /// The rectangles area.\n /// \n public double Area\n {\n get \n {\n if (IsDegenerate)\n return 0;\n else\n return Kernel.Box2_Area(Ptr); \n }\n }\n\n /// \n /// Is the rectangle degenerate.\n /// \n public bool IsDegenerate => Kernel.Box2_IsDegenerate(Ptr);\n\n /// \n /// The side the rectangle the point is on.\n /// \n /// The point.\n /// If the point is iside, outside or on boundary.\n public BOUNDED_SIDE BoundedSide(Point2d point)\n {\n if (IsDegenerate)\n return BOUNDED_SIDE.UNDETERMINED;\n else\n return Kernel.Box2_BoundedSide(Ptr, point);\n }\n\n /// \n /// Does the rectangle contain the point.\n /// \n /// The point\n /// Should a point on \n /// the boundary count as being inside.\n /// Does the rectangle contain the point\n public bool ContainsPoint(Point2d point, bool includeBoundary = true)\n {\n if (IsDegenerate)\n return false;\n else\n return Kernel.Box2_ContainsPoint(Ptr, point, includeBoundary);\n }\n\n /// \n /// Release the unmanaged pointer.\n /// \n protected override void ReleasePtr()\n {\n Kernel.Box2_Release(Ptr);\n }\n\n /// \n /// Round the shape.\n /// \n /// The number of digits to round to.\n public void Round(int digits)\n {\n this.Min = Min.Rounded(digits);\n this.Max = Max.Rounded(digits);\n }\n\n /// \n /// Convert to another kernel.\n /// Must provide a different kernel to convert to or\n /// just a deep copy will be returned.\n /// \n /// The shape with another kernel type.\n public Box2 Convert() where T : CGALKernel, new()\n {\n var k = typeof(T).Name;\n var e = CGALEnum.ToKernelEnum(k);\n var ptr = Kernel.Box2_Convert(Ptr, e);\n return new Box2(ptr);\n }\n\n }\n }\n"
},
{
"path": "CGALDotNet/Geometry/CGALIntersections_Geometry_EEK.cs",
"content": "using System;\nusing System.Collections.Generic;\nusing System.Runtime.CompilerServices;\nusing System.Runtime.InteropServices;\n\nusing CGALDotNetGeometry.Numerics;\nusing CGALDotNetGeometry.Shapes;\n\nnamespace CGALDotNet.Geometry\n{\n\n /// \n /// The static intersection class.\n /// \n public static partial class CGALIntersections\n {\n\n /// --------------------------------------------------------\n /// \n /// The Point DoIntersect functions\n /// \n /// --------------------------------------------------------\n\n public static bool DoIntersect(Point2 point, Line2 line)\n {\n return Intersections_Geometry_EEK_DoIntersect_PointLine(point.Ptr, line.Ptr);\n }\n\n public static bool DoIntersect(Point2 point, Ray2 ray)\n {\n return Intersections_Geometry_EEK_DoIntersect_PointRay(point.Ptr, ray.Ptr);\n }\n\n public static bool DoIntersect(Point2 point, Segment2 segment)\n {\n return Intersections_Geometry_EEK_DoIntersect_PointSegment(point.Ptr, segment.Ptr);\n }\n\n public static bool DoIntersect(Point2 point, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_DoIntersect_PointTriangle(point.Ptr, triangle.Ptr);\n }\n\n public static bool DoIntersect(Point2 point, Box2 box)\n {\n return Intersections_Geometry_EEK_DoIntersect_PointBox(point.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Line DoIntersect functions\n /// \n /// --------------------------------------------------------\n\n public static bool DoIntersect(Line2 line, Point2 point)\n {\n return Intersections_Geometry_EEK_DoIntersect_LinePoint(line.Ptr, point.Ptr);\n }\n\n public static bool DoIntersect(Line2 line, Line2 line2)\n {\n return Intersections_Geometry_EEK_DoIntersect_LineLine(line.Ptr, line2.Ptr);\n }\n\n public static bool DoIntersect(Line2 line, Ray2 ray)\n {\n return Intersections_Geometry_EEK_DoIntersect_LineRay(line.Ptr, ray.Ptr);\n }\n\n public static bool DoIntersect(Line2 line, Segment2 segment)\n {\n return Intersections_Geometry_EEK_DoIntersect_LineSegment(line.Ptr, segment.Ptr);\n }\n\n public static bool DoIntersect(Line2 line, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_DoIntersect_LineTriangle(line.Ptr, triangle.Ptr);\n }\n\n public static bool DoIntersect(Line2 line, Box2 box)\n {\n return Intersections_Geometry_EEK_DoIntersect_LineBox(line.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Ray DoIntersect functions\n /// \n /// --------------------------------------------------------\n\n public static bool DoIntersect(Ray2 ray, Point2 point)\n {\n return Intersections_Geometry_EEK_DoIntersect_RayPoint(ray.Ptr, point.Ptr);\n }\n\n public static bool DoIntersect(Ray2 ray, Line2 line)\n {\n return Intersections_Geometry_EEK_DoIntersect_RayLine(ray.Ptr, line.Ptr);\n }\n\n public static bool DoIntersect(Ray2 ray, Ray2 ray2)\n {\n return Intersections_Geometry_EEK_DoIntersect_RayRay(ray.Ptr, ray2.Ptr);\n }\n\n public static bool DoIntersect(Ray2 ray, Segment2 segment)\n {\n return Intersections_Geometry_EEK_DoIntersect_RaySegment(ray.Ptr, segment.Ptr);\n }\n\n public static bool DoIntersect(Ray2 ray, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_DoIntersect_RayTriangle(ray.Ptr, triangle.Ptr);\n }\n\n public static bool DoIntersect(Ray2 ray, Box2 box)\n {\n return Intersections_Geometry_EEK_DoIntersect_RayBox(ray.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Segment DoIntersect functions\n /// \n /// --------------------------------------------------------\n\n public static bool DoIntersect(Segment2 segment, Point2 point)\n {\n return Intersections_Geometry_EEK_DoIntersect_SegmentPoint(segment.Ptr, point.Ptr);\n }\n\n public static bool DoIntersect(Segment2 segment, Line2 line)\n {\n return Intersections_Geometry_EEK_DoIntersect_SegmentLine(segment.Ptr, line.Ptr);\n }\n\n public static bool DoIntersect(Segment2 segment, Ray2 ray)\n {\n return Intersections_Geometry_EEK_DoIntersect_SegmentRay(segment.Ptr, ray.Ptr);\n }\n\n public static bool DoIntersect(Segment2 segment, Segment2 segment2)\n {\n return Intersections_Geometry_EEK_DoIntersect_SegmentSegment(segment.Ptr, segment2.Ptr);\n }\n\n public static bool DoIntersect(Segment2 segment, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_DoIntersect_SegmentTriangle(segment.Ptr, triangle.Ptr);\n }\n\n public static bool DoIntersect(Segment2 segment, Box2 box)\n {\n return Intersections_Geometry_EEK_DoIntersect_SegmentBox(segment.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Triangle DoIntersect functions\n /// \n /// --------------------------------------------------------\n\n public static bool DoIntersect(Triangle2 triangle, Point2 point)\n {\n return Intersections_Geometry_EEK_DoIntersect_TrianglePoint(triangle.Ptr, point.Ptr);\n }\n\n public static bool DoIntersect(Triangle2 triangle, Line2 line)\n {\n return Intersections_Geometry_EEK_DoIntersect_TriangleLine(triangle.Ptr, line.Ptr);\n }\n\n public static bool DoIntersect(Triangle2 triangle, Ray2 ray)\n {\n return Intersections_Geometry_EEK_DoIntersect_TriangleRay(triangle.Ptr, ray.Ptr);\n }\n\n public static bool DoIntersect(Triangle2 triangle, Segment2 segment)\n {\n return Intersections_Geometry_EEK_DoIntersect_TriangleSegment(triangle.Ptr, segment.Ptr);\n }\n\n public static bool DoIntersect(Triangle2 triangle, Triangle2 triangle2)\n {\n return Intersections_Geometry_EEK_DoIntersect_TriangleTriangle(triangle.Ptr, triangle2.Ptr);\n }\n\n public static bool DoIntersect(Triangle2 triangle, Box2 box)\n {\n return Intersections_Geometry_EEK_DoIntersect_TriangleBox(triangle.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Box DoIntersect functions\n /// \n /// --------------------------------------------------------\n\n public static bool DoIntersect(Box2 box, Point2 point)\n {\n return Intersections_Geometry_EEK_DoIntersect_BoxPoint(box.Ptr, point.Ptr);\n }\n\n public static bool DoIntersect(Box2 box, Line2 line)\n {\n return Intersections_Geometry_EEK_DoIntersect_BoxLine(box.Ptr, line.Ptr);\n }\n\n public static bool DoIntersect(Box2 box, Ray2 ray)\n {\n return Intersections_Geometry_EEK_DoIntersect_BoxRay(box.Ptr, ray.Ptr);\n }\n\n public static bool DoIntersect(Box2 box, Segment2 segment)\n {\n return Intersections_Geometry_EEK_DoIntersect_BoxSegment(box.Ptr, segment.Ptr);\n }\n\n public static bool DoIntersect(Box2 box, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_DoIntersect_BoxTriangle(box.Ptr, triangle.Ptr);\n }\n\n public static bool DoIntersect(Box2 box, Box2 box2)\n {\n return Intersections_Geometry_EEK_DoIntersect_BoxBox(box.Ptr, box2.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Point Intersection functions\n /// \n /// --------------------------------------------------------\n\n public static IntersectionResult2d Intersection(Point2 point, Line2 line)\n {\n return Intersections_Geometry_EEK_Intersection_PointLine(point.Ptr, line.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Point2 point, Ray2 ray)\n {\n return Intersections_Geometry_EEK_Intersection_PointRay(point.Ptr, ray.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Point2 point, Segment2 segment)\n {\n return Intersections_Geometry_EEK_Intersection_PointSegment(point.Ptr, segment.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Point2 point, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_Intersection_PointTriangle(point.Ptr, triangle.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Point2 point, Box2 box)\n {\n return Intersections_Geometry_EEK_Intersection_PointBox(point.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Line Intersection functions\n /// \n /// -----------------------------------------------------\n\n public static IntersectionResult2d Intersection(Line2 line, Point2 point)\n {\n return Intersections_Geometry_EEK_Intersection_LinePoint(line.Ptr, point.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Line2 line, Line2 line2)\n {\n return Intersections_Geometry_EEK_Intersection_LineLine(line.Ptr, line2.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Line2 line, Ray2 ray)\n {\n return Intersections_Geometry_EEK_Intersection_LineRay(line.Ptr, ray.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Line2 line, Segment2 segment)\n {\n return Intersections_Geometry_EEK_Intersection_LineSegment(line.Ptr, segment.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Line2 line, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_Intersection_LineTriangle(line.Ptr, triangle.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Line2 line, Box2 box)\n {\n return Intersections_Geometry_EEK_Intersection_LineBox(line.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Ray Intersection functions\n /// \n /// -----------------------------------------------------\n\n public static IntersectionResult2d Intersection(Ray2 ray, Point2 point)\n {\n return Intersections_Geometry_EEK_Intersection_RayPoint(ray.Ptr, point.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Ray2 ray, Line2 line)\n {\n return Intersections_Geometry_EEK_Intersection_RayLine(ray.Ptr, line.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Ray2 ray, Ray2 ray2)\n {\n return Intersections_Geometry_EEK_Intersection_RayRay(ray.Ptr, ray2.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Ray2 ray, Segment2 segment)\n {\n return Intersections_Geometry_EEK_Intersection_RaySegment(ray.Ptr, segment.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Ray2 ray, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_Intersection_RayTriangle(ray.Ptr, triangle.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Ray2 ray, Box2 box)\n {\n return Intersections_Geometry_EEK_Intersection_RayBox(ray.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Segment Intersection functions\n /// \n /// -----------------------------------------------------\n\n public static IntersectionResult2d Intersection(Segment2 segment, Point2 point)\n {\n return Intersections_Geometry_EEK_Intersection_SegmentPoint(segment.Ptr, point.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Segment2 segment, Line2 line)\n {\n return Intersections_Geometry_EEK_Intersection_SegmentLine(segment.Ptr, line.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Segment2 segment, Ray2 ray)\n {\n return Intersections_Geometry_EEK_Intersection_SegmentRay(segment.Ptr, ray.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Segment2 segment, Segment2 segment2)\n {\n return Intersections_Geometry_EEK_Intersection_SegmentSegment(segment.Ptr, segment2.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Segment2 segment, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_Intersection_SegmentTriangle(segment.Ptr, triangle.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Segment2 segment, Box2 box)\n {\n return Intersections_Geometry_EEK_Intersection_SegmentBox(segment.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Triangle Intersection functions\n /// \n /// -----------------------------------------------------\n\n public static IntersectionResult2d Intersection(Triangle2 triangle, Point2 point)\n {\n return Intersections_Geometry_EEK_Intersection_TrianglePoint(triangle.Ptr, point.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Triangle2 triangle, Line2 line)\n {\n return Intersections_Geometry_EEK_Intersection_TriangleLine(triangle.Ptr, line.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Triangle2 triangle, Ray2 ray)\n {\n return Intersections_Geometry_EEK_Intersection_TriangleRay(triangle.Ptr, ray.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Triangle2 triangle, Segment2 segment)\n {\n return Intersections_Geometry_EEK_Intersection_TriangleSegment(triangle.Ptr, segment.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Triangle2 triangle, Triangle2 triangle2)\n {\n return Intersections_Geometry_EEK_Intersection_TriangleTriangle(triangle.Ptr, triangle2.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Triangle2 triangle, Box2 box)\n {\n return Intersections_Geometry_EEK_Intersection_TriangleBox(triangle.Ptr, box.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Box Intersection functions\n /// \n /// -----------------------------------------------------\n\n public static IntersectionResult2d Intersection(Box2 box, Point2 point)\n {\n return Intersections_Geometry_EEK_Intersection_BoxPoint(box.Ptr, point.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Box2 box, Line2 line)\n {\n return Intersections_Geometry_EEK_Intersection_BoxLine(box.Ptr, line.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Box2 box, Ray2 ray)\n {\n return Intersections_Geometry_EEK_Intersection_BoxRay(box.Ptr, ray.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Box2 box, Segment2 segment)\n {\n return Intersections_Geometry_EEK_Intersection_BoxSegment(box.Ptr, segment.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Box2 box, Triangle2 triangle)\n {\n return Intersections_Geometry_EEK_Intersection_BoxTriangle(box.Ptr, triangle.Ptr);\n }\n\n public static IntersectionResult2d Intersection(Box2 box, Box2 box2)\n {\n return Intersections_Geometry_EEK_Intersection_BoxBox(box.Ptr, box2.Ptr);\n }\n\n /// --------------------------------------------------------\n /// \n /// The Point SqrDistance functions\n /// \n /// -----------------------------------------------------\n\n public static double SqrDistance(Point2 point, Point2 point2)\n {\n return Intersections_Geometry_EEK_SqrDistance_PointPoint(point.Ptr, point2.Ptr);\n }\n\n public static double SqrDistance(Point2 point, Line2