luke/klayout
1
0
Fork 0
mirror of https://github.com/KLayout/klayout.git synced 2026-09-07 02:36:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

WIP

Browse Source
This commit is contained in:
Matthias Koefferlein
2023-08-12 18:12:44 +02:00
parent 14f8c1a61b
commit dfa0a0619b
3 changed files with 1053 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/db/db/dbTriangle.h
+1
View File
@@ -63,6 +63,7 @@ public:
edges_iterator begin_edges () const { return m_edges.begin (); }
edges_iterator end_edges () const { return m_edges.end (); }
size_t num_edges () const { return m_edges.size (); }
size_t level () const { return m_level; }
void set_level (size_t l) { m_level = l; }
src/db/db/dbTriangles.cc
+1043 -5
View File
File diff suppressed because it is too large Load Diff
src/db/db/dbTriangles.h
+9 -2
View File
@@ -34,6 +34,8 @@
namespace db
{
class Layout;
class DB_PUBLIC Triangles
{
public:
@@ -46,8 +48,12 @@ public:
db::DBox bbox () const;
bool check (bool check_delaunay = true) const;
void dump (const std::string &path) const;
std::vector<db::Vertex *> find_points_around (const db::Vertex *vertex, double radius);
/**
* @brief Finds the points within (not "on") a circle of radius "radius" around the given vertex.
*/
std::vector<db::Vertex *> find_points_around (Vertex *vertex, double radius);
db::Vertex *insert_point (const db::DPoint &point, std::vector<db::Triangle *> *new_triangles = 0);
db::Vertex *insert (db::Vertex *vertex, std::vector<db::Triangle *> *new_triangles = 0);
@@ -68,10 +74,11 @@ private:
// NOTE: these functions are SLOW and intended to test purposes only
std::vector<db::Vertex *> find_touching (const db::DBox &box);
std::vector<db::Vertex *> find_inside_circle (const db::DPoint &center, double radius);
db::Layout *to_layout () const;
void remove_outside_vertex (db::Vertex *vertex, std::vector<db::Triangle *> *new_triangles = 0);
void remove_inside_vertex (db::Vertex *vertex, std::vector<db::Triangle *> *new_triangles = 0);
std::vector<db::Triangle *> fill_concave_corners (const std::vector<db::TriangleEdge> &edges);
std::vector<db::Triangle *> fill_concave_corners (const std::vector<TriangleEdge *> &edges);
};
}