Julia for MATLAB Users/Core Language/Mathematics

MathematicsEdit

Most of the below functionality described in the core MATLAB Mathematics documentation has equivalent, often identical, functionality (more often that not with the same syntax) described in the Base.Mathematics section of the Julia manual. Specific equivalents are identified below; often these have the same names as in Matlab, otherwise the Julia equivalent name is noted.

Elementary MathEdit

ArithmeticEdit

See Arithmetic Operators in the Julia manual. Note that in Julia the operators are themselves methods and can be used anywhere a method can. See e.g. the example in the documentation for Base.map.

plus AdditionEdit

uplus Unary plusEdit

minus SubtractionEdit

uminus Unary minusEdit

times Element-wise multiplicationEdit

rdivide Right array divisionEdit

ldivide Left array divisionEdit

power Element-wise powerEdit

mtimes Matrix MultiplicationEdit

mrdivide Solve systems of linear equations   for  Edit

mldivide Solve systems of linear equations   for  Edit

mpower Matrix powerEdit

cumprod Cumulative productEdit

cumsum Cumulative sumEdit

diff Differences and Approximate DerivativesEdit

movsum Moving sumEdit

prod Product of array elementsEdit

sum Sum of array elementsEdit

ceil Round toward positive infinityEdit

fix Round toward zeroEdit

floor Round toward negative infinityEdit

idivide Integer division with rounding optionEdit

mod Remainder after division (modulo operation)Edit

rem Remainder after divisionEdit

round Round to nearest decimal or integerEdit

bsxfun Apply element-wise operation to two arrays with implicit expansion enabledEdit

TrigonometryEdit

See Trigonometric and Hyperbolic functions in the Julia manual.

sin Sine of argument in radiansEdit

sind Sine of argument in degreesEdit

asin Inverse sine in radiansEdit

asind Inverse sine in degreesEdit

sinh Hyperbolic sine of argument in radiansEdit

asinh Inverse hyperbolic sineEdit

cos Cosine of argument in radiansEdit

cosd Cosine of argument in degreesEdit

acos Inverse cosine in radiansEdit

acosd Inverse cosine in degreesEdit

cosh Hyperbolic cosineEdit

acosh Inverse hyperbolic cosineEdit

tan Tangent of argument in radiansEdit

tand Tangent of argument in degreesEdit

atan Inverse tangent in radiansEdit

atand Inverse tangent in degreesEdit

atan2 Four-quadrant inverse tangentEdit

atan2d Four-quadrant inverse tangent in degreesEdit

tanh Hyperbolic tangentEdit

atanh Inverse hyperbolic tangentEdit

csc Cosecant of input angle in radiansEdit

cscd Cosecant of argument in degreesEdit

acsc Inverse cosecant in radiansEdit

acscd Inverse cosecant in degreesEdit

csch Hyperbolic cosecantEdit

acsch Inverse hyperbolic cosecantEdit

sec Secant of angle in radiansEdit

secd Secant of argument in degreesEdit

asec Inverse secant in radiansEdit

asecd Inverse secant in degreesEdit

sech Hyperbolic secantEdit

asech Inverse hyperbolic secantEdit

cot Cotangent of angle in radiansEdit

cotd Cotangent of argument in degreesEdit

acot Inverse cotangent in radiansEdit

acotd Inverse cotangent in degreesEdit

coth Hyperbolic cotangentEdit

acoth Inverse hyperbolic cotangentEdit

hypot Square root of sum of squares (hypotenuse)Edit

deg2rad Convert angle from degrees to radiansEdit

rad2deg Convert angle from radians to degreesEdit

Exponents and LogarithmsEdit

See Powers, logs and roots in the Julia manual.

exp ExponentialEdit

expm1 Compute   accurately for small values of xEdit

log Natural logarithmEdit

log10 Common logarithm (base 10)Edit

log1p Compute log(1+x) accurately for small values of xEdit

log2 Base 2 logarithm and floating-point number dissectionEdit

nextpow2 Exponent of next higher power of 2Edit

nthroot Real nth root of real numbersEdit

pow2 Base 2 power and scale floating-point numbersEdit

reallog Natural logarithm for nonnegative real arraysEdit

realpow Array power for real-only outputEdit

realsqrt Square root for nonnegative real arraysEdit

sqrt Square rootEdit

Complex NumbersEdit

See Complex Numbers in the Julia manual.

abs Absolute value and complex magnitudeEdit

angle Phase angleEdit

complex Create complex arrayEdit

conj Complex conjugateEdit

cplxpair Sort complex numbers into complex conjugate pairsEdit

i Imaginary unitEdit

imag Imaginary part of complex numberEdit

isreal Determine whether array is realEdit

j Imaginary unitEdit

real Real part of complex numberEdit

sign Sign function (signum function)Edit

unwrap Correct phase angles to produce smoother phase plotsEdit

Discrete MathEdit

Equivalents available in Julia BaseEdit

factorial Factorial of inputEdit
gcd Greatest common divisorEdit
lcm Least common multipleEdit

Equivalents available in JuliaMath/Primes.jlEdit

factor Prime factorsEdit
primes Prime numbers less than or equal to input valueEdit
isprime Determine which array elements are primeEdit
nchoosek Binomial coefficient or all combinations (Julia: binomial)Edit

OthersEdit

perms All possible permutationsEdit

The Julia Permutations.permutations(a) function ( Permutations.jl package) returns an iterator object (because the number of permutations can be very large), and in lexicographic order rather than reverse lexicographic. Therefore a drop-in equivalent could be constructed as follows:

julia> perms(a) = reverse(collect(permutations(a)))
perms (generic function with 1 method)

julia> perms([2,4,6])
6-element Array{Array{Int64,1},1}:
 [6, 4, 2]
 [6, 2, 4]
 [4, 6, 2]
 [4, 2, 6]
 [2, 6, 4]
 [2, 4, 6]
rat Rational fraction approximation, rats Rational outputEdit

There doesn't appear to be a direct Julia equivalent of these, but note that unlike Matlab, Julia has a native Rational Number type .

PolynomialsEdit

See the Polynomials.jl package. Note that this package provides a proper type for polynomials, Polynomials.Poly, while in Matlab a polynomial of degree  is represented by a vector of length  whose elements are the coefficients in descending powers of the polynomial.

poly Polynomial with specified roots or characteristic polynomialEdit

polyeig Polynomial eigenvalue problemEdit

polyfit Polynomial curve fittingEdit

Polynomials.polyfit provides comparable basic functionality--the single output argument form of the Matlab function--although it lacks the additional error estimate and centering/scaling features.

residue Partial fraction expansion (partial fraction decomposition)Edit

roots Polynomial rootsEdit

Polynomials.roots provides roots with multiplicity.

polyval Polynomial evaluationEdit

See Base.Math.@evalpoly in the Julia Manual.

polyvalm Matrix polynomial evaluationEdit

conv Convolution and polynomial multiplicationEdit

deconv Deconvolution and polynomial divisionEdit

polyint Polynomial integrationEdit

polyder Polynomial differentiationEdit

Special FunctionsEdit

airy Airy FunctionsEdit

besselh Bessel function of third kind (Hankel function)Edit

besseli Modified Bessel function of first kindEdit

besselj Bessel function of first kindEdit

besselk Modified Bessel function of second kindEdit

bessely Bessel function of second kindEdit

beta Beta functionEdit

betainc Incomplete beta functionEdit

betaincinv Beta inverse cumulative distribution functionEdit

betaln Logarithm of beta functionEdit

ellipj Jacobi elliptic functionsEdit

ellipke Complete elliptic integrals of first and second kindEdit

erf Error functionEdit

erfc Complementary error functionEdit

erfcinv Inverse complementary error functionEdit

erfcx Scaled complementary error functionEdit

erfinv Inverse error functionEdit

expint Exponential integralEdit

gamma Gamma functionEdit

gammainc Incomplete gamma functionEdit

gammaincinv Inverse incomplete gamma functionEdit

gammaln Logarithm of gamma functionEdit

legendre Associated Legendre functionsEdit

psi Psi (polygamma) functionEdit

Cartesian Coordinate System ConversionEdit

cart2pol Transform Cartesian coordinates to polar or cylindricalEdit

cart2sph Transform Cartesian coordinates to sphericalEdit

pol2cart Transform polar or cylindrical coordinates to CartesianEdit

sph2cart Transform spherical coordinates to CartesianEdit

Constants and Test MatricesEdit

ConstantsEdit

See General Number Functions and Constants in the Julia manual.

eps Floating-point relative accuracyEdit

flintmax Largest consecutive integer in floating-point formatEdit

i, j Imaginary unitEdit

In Julia, im is equivalent; this allows i and j to be used as e.g. loop indices without conflict.

Inf InfinityEdit

pi Ratio of circle's circumference to its diameterEdit

Also available as pi in Julia as well as \piTab ↹ 

NaN Not-a-NumberEdit

isfinite Array elements that are finiteEdit

isinf Array elements that are infiniteEdit

isnan Array elements that are NaNEdit

compan Companion matrixEdit

Test MatricesEdit

See the MatrixDepot.jl package; most of the matrices in gallery and all the rest below are available in that package, plus some additional ones.

gallery Test matricesEdit

hadamard Hadamard matrixEdit

hankel Hankel matrixEdit

hilb Hilbert matrixEdit

invhilb Inverse of Hilbert matrixEdit

magic Magic squareEdit

pascal Pascal matrixEdit

rosser Classic symmetric eigenvalue test problemEdit

toeplitz Toeplitz matrixEdit

vander Vandermonde matrixEdit

wilkinson Wilkinson's eigenvalue test matrixEdit

Linear AlgebraEdit

See Linear Algebra in the Julia manual.

mldivide Solve systems of linear equations   for  Edit

mrdivide Solve systems of linear equations   for  Edit

decomposition Matrix decomposition for solving linear systemsEdit

lsqminnorm Minimum norm least-squares solution to linear equationEdit

linsolve Solve linear system of equationsEdit

inv Matrix inverseEdit

pinv Moore-Penrose pseudoinverseEdit

lscov Least-squares solution in presence of known covarianceEdit

lsqnonneg Solve nonnegative linear least-squares problemEdit

sylvester Solve Sylvester equation   for  Edit

eig Eigenvalues and eigenvectorsEdit

eigs Subset of eigenvalues and eigenvectorsEdit

balance Diagonal scaling to improve eigenvalue accuracyEdit

svd Singular value decompositionEdit

svds Subset of singular values and vectorsEdit

gsvd Generalized singular value decompositionEdit

ordeig Eigenvalues of quasitriangular matricesEdit

ordqz Reorder eigenvalues in QZ factorizationEdit

ordschur Reorder eigenvalues in Schur factorizationEdit

polyeig Polynomial eigenvalue problemEdit

qz QZ factorization for generalized eigenvaluesEdit

hess Hessenberg form of matrixEdit

schur Schur decompositionEdit

rsf2csf Convert real Schur form to complex Schur formEdit

cdf2rdf Convert complex diagonal form to real block diagonal formEdit

lu LU matrix factorizationEdit

ldl Block LDL' factorization for Hermitian indefinite matricesEdit

chol Cholesky factorizationEdit

cholupdate Rank 1 update to Cholesky factorizationEdit

qr Orthogonal-triangular decompositionEdit

qrdelete Remove column or row from QR factorizationEdit

qrinsert Insert column or row into QR factorizationEdit

qrupdate Rank 1 update to QR factorizationEdit

planerot Givens plane rotationEdit

transpose Transpose vector or matrixEdit

ctranspose Complex conjugate transposeEdit

mtimes Matrix MultiplicationEdit

mpower Matrix powerEdit

sqrtm Matrix square rootEdit

expm Matrix exponentialEdit

logm Matrix logarithmEdit

funm Evaluate general matrix functionEdit

kron Kronecker tensor productEdit

cross Cross productEdit

dot Dot productEdit

bandwidth Lower and upper matrix bandwidthEdit

tril Lower triangular part of matrixEdit

triu Upper triangular part of matrixEdit

isbanded Determine if matrix is within specific bandwidthEdit

isdiag Determine if matrix is diagonalEdit

ishermitian Determine if matrix is Hermitian or skew-HermitianEdit

issymmetric Determine if matrix is symmetric or skew-symmetricEdit

istril Determine if matrix is lower triangularEdit

istriu Determine if matrix is upper triangularEdit

norm Vector and matrix normsEdit

normest 2-norm estimateEdit

vecnorm Vector-wise normEdit

cond Condition number for inversionEdit

condest 1-norm condition number estimateEdit

rcond Reciprocal condition numberEdit

condeig Condition number with respect to eigenvaluesEdit

det Matrix determinantEdit

null Null spaceEdit

orth Orthonormal basis for range of matrixEdit

rank Rank of matrixEdit

rref Reduced row echelon form (Gauss-Jordan elimination)Edit

trace Sum of diagonal elementsEdit

subspace Angle between two subspacesEdit

Random Number GenerationEdit

rand Uniformly distributed random numbersEdit

randn Normally distributed random numbersEdit

randi Uniformly distributed pseudorandom integersEdit

randperm Random permutationEdit

rng Control random number generationEdit

randStream Random number streamEdit

InterpolationEdit

interp1 1-D data interpolation (table lookup)Edit

interp2 Interpolation for 2-D gridded data in meshgrid formatEdit

interp3 Interpolation for 3-D gridded data in meshgrid formatEdit

interpn Interpolation for 1-D, 2-D, 3-D, and N-D gridded data in ndgrid formatEdit

gRiddedinterpolant Gridded data interpolationEdit

pchip Piecewise Cubic Hermite Interpolating Polynomial (PCHIP)Edit

spline Cubic spline data interpolationEdit

ppval Evaluate piecewise polynomialEdit

mkpp Make piecewise polynomialEdit

unmkpp Extract piecewise polynomial detailsEdit

padecoef Padé approximation of time delaysEdit

interpft 1-D interpolation (FFT method)Edit

ndgrid Rectangular grid in N-D spaceEdit

meshgrid 2-D and 3-D gridsEdit

griddata Interpolate 2-D or 3-D scattered dataEdit

griddatan Interpolate N-D scattered dataEdit

scaTteredinterpolant Interpolate 2-D or 3-D scattered dataEdit

OptimizationEdit

fminbnd Find minimum of single-variable function on fixed intervalEdit

fminsearch Find minimum of unconstrained multivariable function using derivative-free methodEdit

lsqnonneg Solve nonnegative linear least-squares problemEdit

fzero Root of nonlinear functionEdit

optimget Optimization options valuesEdit

optimset Create or edit optimization options structureEdit

Numerical Integration and Differential EquationsEdit

See DifferentialEquations.jl. In particular see the section Translations from MATLAB/Python/R.

Ordinary Differential EquationsEdit

ode45 Solve nonstiff differential equations — medium order methodEdit

ode23 Solve nonstiff differential equations — low order methodEdit

ode113 Solve nonstiff differential equations — variable order methodEdit

ode15s Solve stiff differential equations and DAEs — variable order methodEdit

ode23s Solve stiff differential equations — low order methodEdit

ode23t Solve moderately stiff ODEs and DAEs — trapezoidal ruleEdit

ode23tb Solve stiff differential equations — trapezoidal rule + backward differentiation formulaEdit

ode15i Solve fully implicit differential equations — variable order methodEdit

decic Compute consistent initial conditions for ode15iEdit

odeget Extract ODE option valuesEdit

odeset Create or modify options structure for ODE solversEdit

deval Evaluate differential equation solution structureEdit

odextend Extend solution to ODEEdit

Boundary Value ProblemsEdit

bvp4c Solve boundary value problems for ordinary differential equationsEdit

bvp5c Solve boundary value problems for ordinary differential equationsEdit

bvpinit Form initial guess for BVP solversEdit

bvpxtend Form guess structure for extending boundary value solutionsEdit

bvpget Extract properties from options structure created with bvpsetEdit

bvpset Create or alter options structure of boundary value problemEdit

deval Evaluate differential equation solution structureEdit

Delay Differential EquationsEdit

dde23 Solve delay differential equations (DDEs) with constant delaysEdit

ddesd Solve delay differential equations (DDEs) with general delaysEdit

ddensd Solve delay differential equations (DDEs) of neutral typeEdit

ddeget Extract properties from delay differential equations options structureEdit

ddeset Create or alter delay differential equations options structureEdit

deval Evaluate differential equation solution structureEdit

Partial Differential EquationsEdit

pdepe Solve initial-boundary value problems for parabolic-elliptic PDEs in 1-DEdit

pdeval Evaluate numerical solution of PDE using output of pdepeEdit

Numerical Integration and DifferentiationEdit

integral Numerical integrationEdit

integral2 Numerically evaluate double integralEdit

integral3 Numerically evaluate triple integralEdit

quadgk Numerically evaluate integral, adaptive Gauss-Kronrod quadratureEdit

quad2d Numerically evaluate double integral, tiled methodEdit

cumtrapz Cumulative trapezoidal numerical integrationEdit

trapz Trapezoidal numerical integrationEdit

polyint Polynomial integrationEdit

del2 Discrete LaplacianEdit

diff Differences and Approximate DerivativesEdit

gradient Numerical gradientEdit

polyder Polynomial differentiationEdit

Fourier Analysis and FilteringEdit

fft Fast Fourier transformEdit

fft2 2-D fast Fourier transformEdit

fftn N-D fast Fourier transformEdit

fftshift Shift zero-frequency component to center of spectrumEdit

fftw Define method for determining FFT algorithmEdit

ifft Inverse fast Fourier transformEdit

ifft2 2-D inverse fast Fourier transformEdit

ifftn Multidimensional inverse fast Fourier transformEdit

ifftshift Inverse zero-frequency shiftEdit

nextpow2 Exponent of next higher power of 2Edit

interpft 1-D interpolation (FFT method)Edit

conv Convolution and polynomial multiplicationEdit

conv2 2-D convolutionEdit

convn N-D convolutionEdit

deconv Deconvolution and polynomial divisionEdit

filter 1-D digital filterEdit

filter2 2-D digital filterEdit

ss2tf Convert state-space representation to transfer functionEdit

padecoef Padé approximation of time delaysEdit

Sparse MatricesEdit

spalloc Allocate space for sparse matrixEdit

spdiags Extract and create sparse band and diagonal matricesEdit

speye Sparse identity matrixEdit

sprand Sparse uniformly distributed random matrixEdit

sprandn Sparse normally distributed random matrixEdit

sprandsym Sparse symmetric random matrixEdit

sparse Create sparse matrixEdit

spconvert Import from sparse matrix external formatEdit

issparse Determine whether input is sparseEdit

nnz Number of nonzero matrix elementsEdit

nonzeros Nonzero matrix elementsEdit

nzmax Amount of storage allocated for nonzero matrix elementsEdit

spfun Apply function to nonzero sparse matrix elementsEdit

spones Replace nonzero sparse matrix elements with onesEdit

spparms Set parameters for sparse matrix routinesEdit

spy Visualize sparsity patternEdit

find Find indices and values of nonzero elementsEdit

full Convert sparse matrix to full matrixEdit

dissect Nested dissection permutationEdit

amd Approximate minimum degree permutationEdit

colamd Column approximate minimum degree permutationEdit

colperm Sparse column permutation based on nonzero countEdit

dmperm Dulmage-Mendelsohn decompositionEdit

randperm Random permutationEdit

symamd Symmetric approximate minimum degree permutationEdit

symrcm Sparse reverse Cuthill-McKee orderingEdit

pcg Preconditioned conjugate gradients methodEdit

minres Minimum residual methodEdit

symmlq Symmetric LQ methodEdit

gmres Generalized minimum residual method (with restarts)Edit

bicg Biconjugate gradients methodEdit

bicgstab Biconjugate gradients stabilized methodEdit

bicgstabl Biconjugate gradients stabilized (l) methodEdit

cgs Conjugate gradients squared methodEdit

qmr Quasi-minimal residual methodEdit

tfqmr Transpose-free quasi-minimal residual methodEdit

lsqr LSQR methodEdit

ichol Incomplete Cholesky factorizationEdit

ilu Incomplete LU factorizationEdit

eigs Subset of eigenvalues and eigenvectorsEdit

svds Subset of singular values and vectorsEdit

normest 2-norm estimateEdit

condest 1-norm condition number estimateEdit

sprank Structural rankEdit

etree Elimination treeEdit

symbfact Symbolic factorization analysisEdit

spaugment Form least-squares augmented systemEdit

dmperm Dulmage-Mendelsohn decompositionEdit

etreeplot Plot elimination treeEdit

treelayout Lay out tree or forestEdit

treeplot Plot picture of treeEdit

gplot Plot nodes and links representing adjacency matrixEdit

unmesh Convert edge matrix to coordinate and Laplacian matricesEdit

Graph and Network AlgorithmsEdit

graph Graph with undirected edgesEdit

digraph Graph with directed edgesEdit

addnode Add new node to graphEdit

rmnode Remove node from graphEdit

addedge Add new edge to graphEdit

rmedge Remove edge from graphEdit

flipedge Reverse edge directionsEdit

numnodes Number of nodes in graphEdit

numedges Number of edges in graphEdit

findnode Locate node in graphEdit

findedge Locate edge in graphEdit

edgecount Number of edges between two nodesEdit

reordernodes Reorder graph nodesEdit

subgraph Extract subgraphEdit

bfsearch Breadth-first graph searchEdit

dfsearch Depth-first graph searchEdit

centrality Measure node importanceEdit

maxflow Maximum flow in graphEdit

conncomp Connected graph componentsEdit

biconncomp Biconnected graph componentsEdit

condensation Graph condensationEdit

bctree Block-cut tree graphEdit

minspantree Minimum spanning tree of graphEdit

toposort Topological order of directed acyclic graphEdit

isdag Determine if graph is acyclicEdit

transclosure Transitive closureEdit

transreduction Transitive reductionEdit

isisomorphic Determine whether two graphs are isomorphicEdit

isomorphism Compute isomorphism between two graphsEdit

ismultigraph Determine whether graph has multiple edgesEdit

simplify Reduce multigraph to simple graphEdit

shortestpath Shortest path between two single nodesEdit

shortestpathtree Shortest path tree from nodeEdit

distances Shortest path distances of all node pairsEdit

adjacency Graph adjacency matrixEdit

incidence Graph incidence matrixEdit

laplacian Graph Laplacian matrixEdit

degree Degree of graph nodesEdit

neighbors Neighbors of graph nodeEdit

nearest Nearest neighbors within radiusEdit

indegree In-degree of nodesEdit

outdegree Out-degree of nodesEdit

predecessors Node predecessorsEdit

successors Node successorsEdit

inedges Incoming edges to nodeEdit

outedges Outgoing edges from nodeEdit

plot Plot graph nodes and edgesEdit

labeledge Label graph edgesEdit

labelnode Label graph nodesEdit

layout Change layout of graph plotEdit

highlight Highlight nodes and edges in plotted graphEdit

graphPlot Graph plot for directed and undirected graphsEdit

Computational GeometryEdit

See the JuliaGeometry GitHub organization.

Triangulation RepresentationEdit

triangulation Triangulation in 2-D or 3-DEdit

tetramesh Tetrahedron mesh plotEdit

trimesh Triangular mesh plotEdit

triplot 2-D triangular plotEdit

trisurf Triangular surface plotEdit

Delaunay TriangulationEdit

deLaunaytriangulation Delaunay triangulation in 2-D and 3-DEdit

delaunay Delaunay triangulationEdit

delaunayn N-D Delaunay triangulationEdit

tetramesh Tetrahedron mesh plotEdit

trimesh Triangular mesh plotEdit

triplot 2-D triangular plotEdit

trisurf Triangular surface plotEdit

Spatial SearchEdit

triangulation Triangulation in 2-D or 3-DEdit

deLaunaytriangulation Delaunay triangulation in 2-D and 3-DEdit

dsearchn N-D nearest point searchEdit

tsearchn N-D closest simplex searchEdit

delaunay Delaunay triangulationEdit

delaunayn N-D Delaunay triangulationEdit

Bounding RegionsEdit

boundary Boundary of a set of points in 2-D or 3-DEdit

alphaShape Polygons and polyhedra from points in 2-D and 3-DEdit

convhull Convex hullEdit

convhulln N-D convex hullEdit

Voronoi DiagramEdit

patch Create one or more filled polygonsEdit

voronoi Voronoi diagramEdit

voronoin N-D Voronoi diagramEdit

Elementary PolygonsEdit

The Julia package GeometricalPredicates.jl provides some similar functionality.

inpolygon Points located inside or on edge of polygonal regionEdit

nsidedpoly Regular polygonEdit

polyarea Area of polygonEdit

polybuffer Create buffer around points or linesEdit

rectint Rectangle intersection areaEdit

polyshape 2-D polygonsEdit

addboundary Add polyshape boundaryEdit

rmboundary Remove polyshape boundaryEdit

rmholes Remove holes in polyshapeEdit

rmslivers Remove polyshape boundary outliersEdit

simplify Simplify polyshape boundariesEdit

boundary Vertex coordinates of polyshape boundaryEdit

isequal Determine if polyshape objects are equalEdit

ishole Determine if polyshape boundary is a holeEdit

isinterior Query points inside polyshapeEdit

issimplified Determine if polyshape is well-definedEdit

nearestvertex Query nearest polyshape vertexEdit

numboundaries Number of polyshape boundariesEdit

numsides Number of polyshape sidesEdit

overlaps Determine whether polyshape objects overlapEdit

area Area of polyshapeEdit

boundingbox Bounding box of polyshapeEdit

centroid Centroid of polyshapeEdit

convhull Convex hull of polyshapeEdit

perimeter Perimeter of polyshapeEdit

triangulation Triangulate polyshapeEdit

turningdist Compute turning distance between polyshape objectsEdit

intersect Intersection of polyshape objectsEdit

subtract Difference of two polyshape objectsEdit

union Union of polyshape objectsEdit

xor Exclusive OR of two polyshape objectsEdit

polybuffer Buffer polyshapeEdit

rotate Rotate polyshapeEdit

scale Scale polyshapeEdit

translate Translate polyshapeEdit

holes Convert polyshape hole boundaries to array of polyshape objectsEdit

plot Plot polyshapeEdit

regions Access polyshape regionsEdit

sortboundaries Sort polyshape boundariesEdit

sortregions Sort polyshape regionsEdit