Convex Polygon

This is Brand new so please advise-me if problems occurs.Here you can find an m-file with three different algorithms for inpolygon test.Depending on the input data, the one that is extimate to be the best will be chosen.This version do not support the onpolygon output so tollerance is not...

The function "Return_points_polyg_direct" finds the subset of an arbitrarily large set of 2D points. This subset defines the convex polygon that includes all above points. The function accounts for aligned or identical points.Below is an example of how to use the function with 100 random 2D...

This is Brand new so please advise-me if problems occurs.Here you can find an m-file with three different algorithms for inpolygon test.Depending on the input data, the one that is extimate to be the best will be chosen.This version do not support the onpolygon output so tollerance is not...


Platforms: Matlab

CON2VERT - convert a convex set of constraint inequalities into the set of vertices at the intersections of those inequalities;i.e., solve the "vertex enumeration" problem.V = con2vert(A,b)Converts the polytope (convex polygon, polyhedron, etc.) defined by the system of inequalities A*x = n (m...


Platforms: Matlab

The intention is to make a more flexible and more general function than the Matlab function dblquad. Especially the domain may be given in a more general way, it may be a circle, a rectangle, or any convex polygon. Also different methods may be used. Q = DOUBLEINTEGRAL(FUN, DOMAIN, PARAM) FUN is...


Platforms: Matlab

This function MESH2TETRA converts a triangulated surface mesh into a tetrahedron volume mesh. Main advantage above existing constrained 3D Delaunay is that it will never add new boundary points, (useful for active appearance models) Disadvantage, some highly non-convex surface-shapes cannot be...


Platforms: Matlab

GLC_lib is a C++ library for high performance 3D application based on OpenGL and QT4 GUI. Some GLC_lib features : Supported file format : 3DS, OBJ, COLLADA, 3DXML, OFF, STL. Easy view manipulation, Level of detail, shaders... Feature list : Built in 3D view manipulator (Track Ball, rotate...


Platforms: *nix

Wx::Polygon can draw and manipulate polygons for wxPerl. ABSTRACT This module provides functions for manipulating polygons in wxPerl. new( POLYGON = (Wx::Point,...) | ELLIPSE => (x_offset,y_offset,width,heigth) ) --> Wx::Polygon> Instantiates a new Wx::Polygon with an array of Wx::Points...


Platforms: *nix

Convex provides a flexible pattern matching system designed for creating response driven IRC bots. Convex is a system for creating IRC bots. It features stability, a small memory footprint, a flexible but intuitive configuration system, stealth running, and a secure infrastructure....


Platforms: *nix

Polygon Puzzle project is a tessellation puzzle inspired by Beat The Computer. Pieces of connecting regular polygons are arranged to fit into predefined trays. The mathematical names of the shapes are polyhexes, polyominoes, and polyiamonds. Whats New in This Release: - Two new puzzle trays...


Platforms: *nix

Polygon Cruncher (x32/x64 bits) reduces the number of polygons of your objects without changing their appearance. You keep all details even at high optimization ratio. You also keep texture information, normals, vertex colors. You can also optimized taking care of the symmetry of your objects....


Platforms: Windows, Other

Polygon Cruncher is a software and a plugin for LightWave Modeler V6.x to V10.x (x32 and x64) / Inspire 3D and 3DS Max V5.x to 2012 (x32 and x64) / 3DS VIZ / Autodesk VIZ. Polygon Cruncher reduces the number of polygons of your objects without changing their appearance. You keep all details even...


Platforms: Windows, Other

Java Convex Optimizer is designed as an useful Open Source library that's been implemented in the Java programming language. It was built in order to address the problem of solving a convex minimization with equalities and inequalities contraints.


Platforms: Windows

This script returns the convex hull (separated into upper and lower chains of vertices) and the diameter (farthest pair of points), given input consisting of a list of 2d points represented as pairs (x,y). The convex hull algorithm is Graham's scan, using a coordinate-based sorted order rather...


Platforms: Windows, Mac, *nix, Python, BSD Solaris

This simple code calculates the convex hull of a set of 2D points and generates EPS files to visualise them.


Platforms: Windows, Mac, *nix, Python, BSD Solaris

Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the call to unique function which can be very slow for...


Platforms: Matlab

QUADPROG2 - Convex Quadratic Programming SolverFeaturing the SOLVOPT freeware optimizerNew for version 1.1:* Significant speed improvement* Geometric Preconditioning* Improved Error CheckingUSAGE:[x,v] = quadprog2(H,f,A,b)[x,v] = quadprog2(H,f,A,b,guess)[x,v,opt] = ...Minimizes the function v =...


Platforms: Matlab

Calculate the distance from a point to 2-D polygon, and the point on the polygon closest to the point.This is based on the function made by Michael Yoshpe. Also include the test suggested by Eric Schmitz.


Platforms: Matlab

Calculates point position in 2D polygon: inside, outside, is a vertex and on the edge.


Platforms: Matlab

Thiessen Polygons, or Voronoi Polygons, are geometric constructs dividing a plane based on proximity to given points. Named after Alfred Thiessen, each polygon encapsulates points closer to its origin than any other. Formed by connecting midpoints between adjacent points, these polygons establish...


Platforms: Windows, Windows 8, Windows 7, Windows Server