gmsh-TingyuanDoc  0.1
An Open-Source Timing-driven Analytical Mixed-size FPGA Placer
DivideAndConquer.cpp File Reference
#include <stdexcept>
#include "GmshMessage.h"
#include "DivideAndConquer.h"
#include "Numeric.h"
#include "fullMatrix.h"
#include "robustPredicates.h"
#include "BackgroundMeshTools.h"
#include "OS.h"
#include "GPoint.h"
#include "GFace.h"
#include "MLine.h"
Include dependency graph for DivideAndConquer.cpp:

Go to the source code of this file.

Macros

#define Pred(x)   ((x)->prev)
 
#define Succ(x)   ((x)->next)
 

Functions

static int comparePoints (const void *i, const void *j)
 
void centroidOfOrientedBox (std::vector< SPoint2 > &pts, const double &angle, double &xc, double &yc, double &inertia, double &area)
 
void centroidOfPolygon (SPoint2 &pc, std::vector< SPoint2 > &pts, double &xc, double &yc, double &inertia, double &areaCell, simpleFunction< double > *bgm)
 

Macro Definition Documentation

◆ Pred

#define Pred (   x)    ((x)->prev)

Definition at line 31 of file DivideAndConquer.cpp.

◆ Succ

#define Succ (   x)    ((x)->next)

Definition at line 32 of file DivideAndConquer.cpp.

Function Documentation

◆ centroidOfOrientedBox()

void centroidOfOrientedBox ( std::vector< SPoint2 > &  pts,
const double &  angle,
double &  xc,
double &  yc,
double &  inertia,
double &  area 
)

Definition at line 690 of file DivideAndConquer.cpp.

Here is the call graph for this function:

◆ centroidOfPolygon()

void centroidOfPolygon ( SPoint2 pc,
std::vector< SPoint2 > &  pts,
double &  xc,
double &  yc,
double &  inertia,
double &  areaCell,
simpleFunction< double > *  bgm 
)

Definition at line 717 of file DivideAndConquer.cpp.

Here is the call graph for this function:

◆ comparePoints()

static int comparePoints ( const void *  i,
const void *  j 
)
static

Definition at line 296 of file DivideAndConquer.cpp.

Referenced by DocRecord::BuildDelaunay().

Here is the caller graph for this function: