25:["$","title",null,{"children":"CeeGAL | mheard03 | Observable"}] 49:T63e,// https://github.com/CGAL/cgal/blob/master/Kernel_23/include/CGAL/Bbox_2.h class Bbox_2 { constructor(x_min, y_min, x_max, y_max) { CGAL_kernel_precondition(arguments.length == 0 || arguments.length == 4, "Bbox_2 constructor takes 0 or 4 arguments."); if (arguments.length == 0) { x_min = Infinity; y_min = Infinity; x_max = -Infinity; y_max = -Infinity; } this._rep = new Float64Array([x_min, y_min, x_max, y_max]); } xmin() { return this._rep[0]; } ymin() { return this._rep[1]; } xmax() { return this._rep[2]; } ymax() { return this._rep[3]; } x_span() { return this.xmax() - this.xmin(); } y_span() { return this.ymax() - this.ymin(); } dimension() { return 2; }; equals(b) { return this.xmin == b.xmin && this.xmax == b.xmax && this.ymin == b.ymin && this.ymax == b.ymax; } min(i) { CGAL_kernel_precondition(i == 0 || i == 1); return (i == 0) ? this.xmin : this.ymin; } max(i) { CGAL_kernel_precondition(i == 0 || i == 1); return (i == 0) ? this.xmax : this.ymax; } sum(b) { return new Bbox_2( Math.min(this.xmin(), b.xmin()), Math.min(this.ymin(), b.ymin()), Math.max(this.xmax(), b.xmax()), Math.max(this.ymax(), b.ymax()), ) } add(b) { const rep = this._rep; rep[0] = Math.min(this.xmin(), b.xmin()); rep[1] = Math.min(this.ymin(), b.ymin()); rep[2] = Math.max(this.xmax(), b.xmax()); rep[3] = Math.max(this.ymax(), b.ymax()); } dilate(dist) { throw "Not implemented"; } do_overlap(bb1, bb2) { throw "Not implemented"; } }4a:T103e,// https://github.com/CGAL/cgal/blob/master/Kernel_23/include/CGAL/Segment_2.h class Segment_2 { constructor( Segment_2() {} // conversion from implementation class object to interface class object Segment_2(const RSegment_2& s) : RSegment_2(s) {} Segment_2(RSegment_2&& s) : RSegment_2(std::move(s)) {} Segment_2(const Point_2 &sp, const Point_2 &ep) : RSegment_2(typename R::Construct_segment_2()(Return_base_tag(), sp,ep)) {} decltype(auto) source() const { return R_().construct_source_2_object()(*this); } decltype(auto) target() const { return R_().construct_target_2_object()(*this); } decltype(auto) start() const { return source(); } decltype(auto) end() const { return target(); } decltype(auto) min BOOST_PREVENT_MACRO_SUBSTITUTION() const { typename R_::Less_xy_2 less_xy; return less_xy(source(), target()) ? source() : target(); } decltype(auto) max BOOST_PREVENT_MACRO_SUBSTITUTION() const { typename R_::Less_xy_2 less_xy; return less_xy(source(), target()) ? target() : source(); } decltype(auto) vertex(int i) const { return (i%2 == 0) ? source() : target(); } decltype(auto) point(int i) const { return vertex(i); } decltype(auto) operator[](int i) const { return vertex(i); } bool is_horizontal() const; bool is_vertical() const; bool has_on(const Point_2 &p) const; bool collinear_has_on(const Point_2 &p) const; FT squared_length() const; bool is_degenerate() const; Bbox_2 bbox() const { return R().construct_bbox_2_object()(*this); } bool operator==(const Segment_2 &s) const { return R().equal_2_object()(*this, s); } bool operator!=(const Segment_2 &s) const { return !(*this == s); } Direction_2 direction() const { typename R::Construct_vector_2 construct_vector; return Direction_2( construct_vector( source(), target())); } Vector_2 to_vector() const { typename R::Construct_vector_2 construct_vector; return construct_vector( source(), target()); } Line_2 supporting_line() const { typename R::Construct_line_2 construct_line; return construct_line(*this); } Segment_2 opposite() const { return R().construct_opposite_segment_2_object()(*this); } Segment_2 transform(const Aff_transformation_2 &t) const { return Segment_2(t.transform(source()), t.transform(target())); } }; template < class R_ > CGAL_KERNEL_INLINE bool Segment_2::is_horizontal() const { return R_().equal_y_2_object()(source(), target()); } template < class R_ > CGAL_KERNEL_INLINE bool Segment_2::is_vertical() const { return R_().equal_x_2_object()(source(), target()); } template < class R_ > CGAL_KERNEL_INLINE bool Segment_2:: has_on(const typename R_::Point_2 &p) const { return R_().are_ordered_along_line_2_object()(source(), p, target()); } template < class R_ > inline bool Segment_2:: collinear_has_on(const typename R_::Point_2 &p) const { return R_().collinear_has_on_2_object() (*this, p); } template < class R_ > CGAL_KERNEL_INLINE typename Segment_2::FT Segment_2::squared_length() const { return R_().compute_squared_length_2_object()(*this); } template < class R_ > inline bool Segment_2::is_degenerate() const { return R().is_degenerate_2_object()(*this); } template < class R > std::ostream & operator<<(std::ostream &os, const Segment_2 &s) { switch(IO::get_mode(os)) { case IO::ASCII : return os << s.source() << ' ' << s.target(); case IO::BINARY : return os << s.source() << s.target(); default: return os << "Segment_2(" << s.source() << ", " << s.target() << ")"; } } template < class R > std::istream & operator>>(std::istream &is, Segment_2 &s) { typename R::Point_2 p, q; is >> p >> q; if (is) s = Segment_2(p, q); return is; } } //namespace CGAL #endif // CGAL_SEGMENT_2_H4b:T841,// This record encapsulates the defining contour halfedges for a node (both contour and skeleton) class Triedge { constructor(aE0, aE1, aE2) { // Contour nodes (input polygon vertices) have only 2 defining contour edges // Skeleton nodes (offset polygon vertices) have 3 defining contour edges // Unsupplied arguments get default constructed, i.e., "null". this._mE = [aE0, aE1, aE2].map(e => e ?? null); } static equals() { return 3 } e(i) { const result = this._mE[i]; if (!result && !Number.isInteger(i)) throw "Index must be less than 3"; } get e0() { return this.e(0); } get e1() { return this.e(1); } get e2() { return this.e(2); } get is_valid() { return this.e0 !== null && this.e1 !== null; } get is_contour() { return this.e2 === null; } get is_skeleton() { return this.e2 !== null; } get is_contour_terminal() { return Triedge_.equals(this.e0, this.e1); } get is_skeleton_terminal() { return Triedge_.equals(this.e0, this.e1) || Triedge.equals(this.e1, this.e2); } equals(other) { return (this._number_of_unique_edges() == other._number_of_unique_edges()) && (this._CountInCommon(other) == other._number_of_unique_edges()); } static bitwiseAnd(x, y) { return new Triedge(x.e0, x.e1, (x.e0() == y.e0() || x.e1() == y.e0()) ? y.e1() : y.e0()); } // returns 1 if aE is one of the halfedges stored in this triedge, 0 otherwise. contains(aE) { return +this._mE.some(edge => Triedge.equals(edge, aE)); } _number_of_unique_edges() { if (this.is_contour) { return this.is_contour_terminal ? 1 : 2; } else { return this.is_skeleton_terminal ? 2 : 3; } } // Returns the number of common halfedges in the two triedges x and y static _CountInCommon(x, y) { const edges = [y.e0]; if (!Triedge.equals(y.e0, y.e1)) edges.push(y.e1); if (!Triedge.equals(y.e0, y.e2) && !Triedge.equals(y.e1, y.e2)) edges.push(y.e2); let count = x.contains(edges[0]) + x.contains(edges[1]); if (edges.length > 2) count += x.contains(edges[2]); return count; } }4c:T1d01,// Copyright (c) 2005-2008 Fernando Luis Cacciola Carballal. // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL$ // $Id$ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Fernando Cacciola // inline char const* trisegment_collinearity_to_string( Trisegment_collinearity c ) { switch ( c ) { case TRISEGMENT_COLLINEARITY_NONE : return "<>" ; case TRISEGMENT_COLLINEARITY_01 : return "<0,1>" ; case TRISEGMENT_COLLINEARITY_12 : return "<1,2>" ; case TRISEGMENT_COLLINEARITY_02 : return "<0,2>" ; case TRISEGMENT_COLLINEARITY_ALL : return "<0,1,2>" ; } return "!!UNKNOWN COLLINEARITY!!" ; } namespace internal { template <> struct Minmax_traits< Trisegment_collinearity > { static const Trisegment_collinearity min = TRISEGMENT_COLLINEARITY_NONE; static const Trisegment_collinearity max = TRISEGMENT_COLLINEARITY_ALL; }; } // namespace internal template using Trisegment_2_ptr = std::shared_ptr; template class Trisegment_2 { typedef Trisegment_2 Self; public: typedef Trisegment_2_ptr Self_ptr ; typedef typename K::FT FT ; Trisegment_2 ( Segment const& aE0 , FT const& aW0 , Segment const& aE1 , FT const& aW1 , Segment const& aE2 , FT const& aW2 , Trisegment_collinearity aCollinearity , std::size_t aID ) : mID(aID) { mCollinearity = aCollinearity ; mE[0] = aE0 ; mE[1] = aE1 ; mE[2] = aE2 ; mW[0] = aW0 ; mW[1] = aW1 ; mW[2] = aW2 ; switch ( mCollinearity ) { case TRISEGMENT_COLLINEARITY_01: mCSIdx=0; mNCSIdx=2; break ; case TRISEGMENT_COLLINEARITY_12: mCSIdx=1; mNCSIdx=0; break ; case TRISEGMENT_COLLINEARITY_02: mCSIdx=0; mNCSIdx=1; break ; case TRISEGMENT_COLLINEARITY_ALL: mCSIdx = mNCSIdx = (std::numeric_limits::max)(); break ; case TRISEGMENT_COLLINEARITY_NONE: mCSIdx = mNCSIdx = (std::numeric_limits::max)(); break ; } } std::size_t& id() { return mID; } const std::size_t& id() const { return mID; } static Trisegment_2 null() { return Self_ptr() ; } Trisegment_collinearity collinearity() const { return mCollinearity ; } Segment const& e( unsigned idx ) const { CGAL_precondition(idx<3) ; return mE[idx] ; } Segment const& e0() const { return e(0) ; } Segment const& e1() const { return e(1) ; } Segment const& e2() const { return e(2) ; } FT const& w( unsigned idx ) const { CGAL_precondition(idx<3) ; return mW[idx] ; } FT const& w0() const { return w(0) ; } FT const& w1() const { return w(1) ; } FT const& w2() const { return w(2) ; } // If 2 out of the 3 edges are collinear they can be reclassified as 1 collinear edge (any of the 2) and 1 non-collinear. // These methods returns the edges according to that classification. // PRECONDITION: Exactly 2 out of 3 edges are collinear Segment const& collinear_edge () const { return e(mCSIdx) ; } Segment const& non_collinear_edge() const { return e(mNCSIdx) ; } Segment const& other_collinear_edge() const { switch ( mCollinearity ) { case TRISEGMENT_COLLINEARITY_01: return e(1); case TRISEGMENT_COLLINEARITY_12: return e(2); case TRISEGMENT_COLLINEARITY_02: return e(2); default: CGAL_assertion(false); return e(0); // arbitrary, meaningless value because a const& is expected } } FT const& collinear_edge_weight() const { return w(mCSIdx) ; } FT const& non_collinear_edge_weight() const { return w(mNCSIdx) ; } FT const& other_collinear_edge_weight() const { switch ( mCollinearity ) { case TRISEGMENT_COLLINEARITY_01: return w(1); case TRISEGMENT_COLLINEARITY_12: return w(2); case TRISEGMENT_COLLINEARITY_02: return w(2); default: CGAL_assertion(false); return w(0); // arbitrary, meaningless value because a const& is expected } } Self_ptr const& child_l() const { return mChildL ; } Self_ptr const& child_r() const { return mChildR ; } Self_ptr const& child_t() const { return mChildT ; } void set_child_l( Self_ptr const& aChild ) { mChildL = aChild ; } void set_child_r( Self_ptr const& aChild ) { mChildR = aChild ; } void set_child_t( Self_ptr const& aChild ) { mChildT = aChild ; } enum SEED_ID { LEFT, RIGHT, THIRD } ; // Indicates which of the seeds is collinear for a normal collinearity case. // PRECONDITION: The collinearity is normal. SEED_ID degenerate_seed_id() const { Trisegment_collinearity c = collinearity(); return c == TRISEGMENT_COLLINEARITY_01 ? LEFT : c == TRISEGMENT_COLLINEARITY_12 ? RIGHT : THIRD ; } static void print ( std::ostream& os, Self const& aTri, int aDepth ) { const std::string lPadding = std::string(2 * aDepth, ' '); os << lPadding << "[&: " << &aTri << " ID: " << aTri.id() << "\n" << lPadding << "\tE" << aTri.e0().mID << " E" << aTri.e1().mID << " E" << aTri.e2().mID << "\n" << lPadding << "\t" << s2str(aTri.e0()) << " w = " << n2str(aTri.w0()) << ";" << "\n" << lPadding << "\t" << s2str(aTri.e1()) << " w = " << n2str(aTri.w1()) << ";" << "\n" << lPadding << "\t" << s2str(aTri.e2()) << " w = " << n2str(aTri.w2()) << ";" << "\n" << lPadding << "\tCollinearity: " << trisegment_collinearity_to_string(aTri.collinearity()) << "\n" << lPadding << "]\n" << std::flush; } static void recursive_print ( std::ostream& os, Self_ptr const& aTriPtr, int aDepth ) { const std::string lPadding = std::string(2 * aDepth, ' '); os << "\n" ; if ( aTriPtr ) { print(os, *aTriPtr, aDepth); if ( aTriPtr->child_l() ) { os << lPadding << "left child:" ; recursive_print(os,aTriPtr->child_l(),aDepth+1); } if ( aTriPtr->child_r() ) { os << lPadding << "right child:" ; recursive_print(os,aTriPtr->child_r(),aDepth+1); } if ( aTriPtr->child_t() ) { os << lPadding << "third child:" ; recursive_print(os,aTriPtr->child_t(),aDepth+1); } } else { os << "{null}" ; } } friend std::ostream& operator << ( std::ostream& os, Self const& aTrisegment ) { print(os, aTrisegment, 0); return os ; } friend std::ostream& operator << ( std::ostream& os, Self_ptr const& aTriPtr ) { if(aTriPtr) print(os, *aTriPtr, 0); else os << "{null}" ; return os ; } private : std::size_t mID; Segment mE[3]; FT mW[3]; Trisegment_collinearity mCollinearity ; unsigned mCSIdx, mNCSIdx ; Self_ptr mChildL ; Self_ptr mChildR ; // this is the potential child of e2-e0, if it exists. It is used only in the configuration // of e0 and e2 collinear as the common child gives where the bisector starts (as it is not // necessarily the middle of the gap between e2 and e0). Self_ptr mChildT ; } ; } // end namespace CGAL #endif // CGAL_SLS_TRISEGMENT_H4d:[] 29:{"id":"ac76f67976c43084","slug":null,"title":"CeeGAL","thumbnail":"313617f08d5a973e8a6f260caccc72d3aa04a7963d67e1a8e5fc4d62fb03f95d","access_level":"public","create_time":"$D2023-12-02T16:21:12.577Z","update_time":"$D2023-12-03T18:16:17.568Z","view_time":null,"first_public_time":"$D2023-12-02T16:21:12.577Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"02d4ccf8951f2f02","login":"mheard03","name":"","avatar_url":"https://avatars-next.observableusercontent.com/ae42ada5dc924d7cd620a4ae3bb6279a3e82fb649668ee6c0729bdada1ebf016","tier":"starter_2024","bio":"","following":false},"version":123,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"6afb6cac5f188ec0","login":"mheard03","name":"","avatar_url":"https://avatars-next.observableusercontent.com/ae42ada5dc924d7cd620a4ae3bb6279a3e82fb649668ee6c0729bdada1ebf016","tier":null,"bio":"","following":false}],"members":[{"type":"individual","id":"6afb6cac5f188ec0","login":"mheard03","name":"","avatar_url":"https://avatars-next.observableusercontent.com/ae42ada5dc924d7cd620a4ae3bb6279a3e82fb649668ee6c0729bdada1ebf016","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"titling":"auto","title":"CeeGAL","cells":[{"id":0,"value":"# CeeGAL","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":51,"value":"## Kernel_23","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":88,"value":"### kernel_assertions.h","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":73,"value":"function CGAL_kernel_precondition(testResult, msg) {\n if (testResult !== true) throw msg ?? \"CGAL_kernel_precondition not met.\";\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":100,"value":"### CeeGAL","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":55,"value":"$49","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":110,"value":"// https://github.com/CGAL/cgal/blob/master/Kernel_23/include/CGAL/Point_2.h\nclass Point_2 {\n constructor(x, y) {\n CGAL_kernel_precondition(arguments.length == 0 || arguments.length == 2, \"Point_2 constructor takes 0 or 2 arguments.\");\n if (arguments.length == 0) {\n x = 0;\n y = 0;\n }\n this._rep = new Float64Array([x, y]);\n }\n\n x() { return this._rep[0]; }\n y() { return this._rep[1]; }\n dimension() { return 2; }\n bbox() { throw \"Not implemented\"; }\n transform(t) { throw \"Not implemented\"; }\n\n add(v) { throw \"Not implemented\"; }\n subtract(v) { throw \"Not implemented\"; }\n};","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":53,"value":"$4a","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":18,"value":"## Misc","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":22,"value":"Triedge.equals.toString()","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":32,"value":"{\n const te = new Triedge();\n return te.equals.toString()\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":20,"value":"$4b","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":48,"value":"Trisegment_collinearity = {\n const result = {\n TRISEGMENT_COLLINEARITY_NONE: 0,\n TRISEGMENT_COLLINEARITY_01: 1,\n TRISEGMENT_COLLINEARITY_12: 2,\n TRISEGMENT_COLLINEARITY_02: 3,\n TRISEGMENT_COLLINEARITY_ALL: 4\n };\n Object.freeze(result);\n return result;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":46,"value":"$4c","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":11,"value":"## Straight_Skeleton_aux.h","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":7,"value":"-----\n## Imports","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":5,"value":"Flatten = require('@flatten-js/core')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W4d","stdlib":"1"}} 24:null