Polygon visibility 2026-11-05
Two points of a filled simple polygon , including its boundary, are mutually visible when their joining closed line segment lies entirely in . The visible region from is . A segment crossing even a small exterior gap breaks visibility.
Every pair of points in a convex polygon is visible by the definition of convexity. In a nonconvex polygon, an inward corner can block a segment although both endpoints lie inside. A point sees the whole polygon precisely when it belongs to the kernel of a polygon. Thus a nonempty kernel permits one stationary point observer to see the entire filled region.
Visibility depends on the filled-region and boundary convention, rather than only on graph adjacency between polygon vertices. It is used in geometric path planning and coverage, where the whole intervening segment must be checked for obstruction.
Positive-product maximization on a convex set Created 2026-10-14 Updated 2026-11-05
Let be compact and convex, and assume that it contains a point with both coordinates positive. The product has a unique maximizer over , and that maximizer lies in the positive quadrant. Compactness gives existence; the strictly positive attainable product excludes points on the axes. On the positive quadrant, maximizing is equivalent to maximizing , a strictly concave function. A segment between two distinct maximizers would contradict strict concavity, proving uniqueness.
The quadrant restriction matters. The line segment from to is a compact convex set meeting the positive quadrant, but its global product maximum over the entire segment is at the negative endpoint. The result concerns the positive feasible portion, unless the original feasible set is itself confined to the nonnegative quadrant.
Punctured ball 2026-10-25
A punctured ball is an open ball with its centre removed. In the real line it has two connected components. In Euclidean space of dimension it is path-connected: for any two points, choose a third point inside the ball outside the two lines through the centre and those points. Such a point exists since two lines do not cover an open ball in dimension at least two. The two line segments joining through that point stay inside the ball, which is a convex set, and avoid its centre. They form a continuous path.
Radial sampling interval 2026-11-05
The radial sampling interval is the separation between consecutive radii at which a radial measurement is made. For Sholl analysis, it determines the spacing of concentric Euclidean circles used to sample intersection counts about a fixed center. The documentation distinguishes this step from the starting and ending radii.[ref]
For constant positive spacing, the sampling grid is
where is the chosen upper radius. For , and , the sampled radii are 1, 2, 3 and 4. The upper bound 4.4 is not itself sampled. The software documentation explicitly notes this endpoint issue when the step does not divide the difference between ending and starting radii.[ref]
A purely geometric example shows what coarse spacing can miss. Begin with a straight line segment from to and use the origin as center. Add a short branch from to . Its distance from the center increases continuously from to , since . Counting shared endpoints only once, the added branch contributes one extra distinct intersection exactly for
At radii 1, 2, 3 and 4, the branched and unbranched traces both give . An additional sample at instead gives two intersections for the branched trace. The feature exists in the geometric input but falls between the coarse sample radii.
Figure 1.
A geometric branch missed by coarse radial sampling
. Own synthetic line segments: trunk from(0,0)to(4,0), branch from(2.1,0)to(2.4,0.7). A circle of radius2.25 has two intersections, while samples at radii1,2,3,4 each report one. Distances are chosen geometric units, not specimen measurements or a reconstruction. Details.
Smaller supplies a denser set of probes, while changing shifts their positions. Neither operation restores structure already lost through image segmentation or finite pixel pitch. In particular, closer numerical spacing is distinct from improved physical spatial resolution. Report the center, calibrated distance units, starting radius, interval and sampled endpoint list with a Sholl profile.
The program's zero step setting is a special request for finite image-derived sampling, rather than the literal choice in the grid above. For image input, the documentation describes voxel-scale increments and a calibration-dependent rule for unequal pixel dimensions.[ref]
Sholl profile 2026-11-05
A Sholl profile records intersection counts as a function of distance from a chosen center. For a thin geometric tracing it is an exact counting function; a profile obtained from sampled images also depends on the software's sampling and segmentation conventions.
In an ideal planar model, let be a finite embedded rooted tree of line segments in the Euclidean plane with chosen root . Its Sholl profile counts distinct intersections:
This is a geometric model for thin tracings; the software documentation separately addresses sampling binary images and handling image segmentation.[ref]
For an original simple example, take three straight radial segments from the origin, pointing in different directions, with lengths 1, 2 and 4. For radii , the counts are respectively . The segment of length 1 contributes at but not beyond it; record the boundary convention when defining the count. No branch points are needed for this decreasing profile: different lengths of terminal segments already produce it.
The profile retains radial occupancy but discards the angles and the identities of the intersected paths. In particular, a Sholl profile does not determine rooted tree topology. Sampling only a finite list of radii loses still more information; it should not be silently equated with knowledge of the complete continuous-radius counting function.
Side of a polygon Created 2026-10-14 Updated 2026-10-20
A side of a polygon is a line segment joining two consecutive vertices of a polygon in its boundary.
Simplex Created 2026-09-24 Updated 2026-11-05
An -simplex is the convex hull of affinely independent points. Every point has a unique expression with and , its barycentric coordinates. A zero-simplex is a point, a one-simplex a line segment, a two-simplex a filled triangle, and a three-simplex a tetrahedron. Its faces are obtained by taking subsets of the vertices. This uniform description allows simplicial complexes to build spaces from elementary pieces in every dimension.
SNT is an ImageJ framework for tracing, displaying and quantitatively analyzing branching structures in multidimensional images. It provides editing and automated tracing tools as well as a scripting interface. Its computational components also support filamentous structures outside the package's original application domain.[ref]
A trace encodes connected sample points rather than merely an image of a bright line. For an original geometric example, take successive physical coordinates , and in micrometres. The trace's length is the sum of its two line segment lengths,
whereas the endpoint Euclidean distance is . The ratio distinguishes a bent trace from a straight one with the same endpoints. SNT's metrics documentation defines path/branch length through internode distances and branch contraction through this endpoint-distance-to-path-length ratio.[ref]
Those calculations require calibrated coordinates and the intended connectivity. Rescaling image axes changes lengths; connecting the wrong endpoints changes the traced object. The framework's Sholl analysis is a different summary: it produces a Sholl profile of radial intersections. The fact that a Sholl profile does not determine rooted tree topology explains why a profile cannot replace the connected trace when the question concerns its branching structure. This example concerns software data and geometry, not measured anatomy.
Let be an integrable random variable taking values in an open interval . Suppose is a differentiable strictly convex function. Then its expected value has equality in Jensen's inequality exactly when is constant almost surely.
First lies in : at each finite endpoint, taking the expected value of the strictly positive distance to that endpoint gives a strictly positive distance for . A tangent affine function supports at , so
Strict convexity forces for . Indeed, equality at another point would force the graph to coincide with its supporting line on the connecting line segment, contradicting strict convexity. Therefore
and the right side is zero exactly when almost surely.
The tangent affine function of is an integrable random variable, so has an integrable negative part. Thus is well defined, possibly , even if absolute integrability was not assumed. Equality to automatically excludes that infinite case.
Subdivision curve 2026-10-14
A subdivision curve is the limit of repeated refinement of a control polygon, when that limit exists. Each finite stage still consists of line segments; the limiting curve can have a continuous derivative. Linear stationary rules, which use the same fixed weighted averages at every stage, can be studied through their subdivision masks and often represent splines. An interpolation rule retains the old control points, as in binary linear interpolatory subdivision; an approximating rule such as Chaikin subdivision generally moves away from them. Increasing the number of control points alone does not prove convergence or smoothness.
// Target: analysis.bigb
Supremum of a sum 2026-10-18
Let be nonempty sets of real numbers bounded above. Their Minkowski sum is , allowing every pair from the Cartesian product . Then
The sum of the two suprema is an upper bound for every permitted sum. For the reverse bound, use the approximation property of a supremum to choose and . Their sum is within of the claimed value. This reasoning does not require either supremum to be a maximum.
Separate choices matter. On , choose the functions and . Each has supremum one, but their sum at a shared input is always one:
The maximum of occurs at , while that of occurs at . A common input cannot realize both choices. With separate inputs, choosing and gives . The allowed pairs of output values are the entire unit square for separate inputs, but only the line segment for the shared input.
Figure 1.
Separate input choices fill a square; one shared input restricts the attainable sums
. Original example , on . Left: every pair is permitted for separate inputs, including with sum two. Right: the shared-input pairs lie on , with sum one. The colours encode ; this is a deterministic constraint on choices, not probabilistic independence. Details.
For any two bounded functions on the same nonempty domain of a function, the useful general estimate is
The inequality can be strict, as the example shows. Equality does not require attained maxima, but it does require that the two large values can be approached at compatible inputs. For example, on gives equality with value two, although neither function reaches its supremum. This distinction is useful when an objective function combines terms sharing a decision variable: adding the best possible termwise scores gives an upper bound, not necessarily a feasible combined score.
Sweep-line algorithm Created 2026-10-20 Updated 2026-11-05
A sweep-line algorithm processes geometric events in the order a conceptual line crosses a plane. It keeps an event queue and a status describing objects intersecting the current line. For horizontal and vertical line segments, sweep left to right: insert a horizontal segment at its left endpoint, query active heights at a vertical segment, and delete horizontals at their right endpoints. A balanced search structure supports the updates and range reporting. Equal-coordinate event ordering determines whether endpoint contacts count. The method reduces a two-dimensional problem to a changing one-dimensional ordering rather than physically sampling every line position.
A ternary tie-line consistency residual quantifies how far an overall three-component composition is from the mass balance predicted by specified endpoints of a ternary liquid-liquid tie line. It is a geometric consistency check on a proposed two-phase decomposition. A thermodynamic tie line connects coexisting equilibrium compositions; the calculation below checks the lever rule for those endpoints, rather than independently proving that they are equilibrium phases.[ref]
Use mole fraction vectors for the endpoint liquids and for the overall composition, all normalized to sum to one. Put . For a proposed mole-based phase fraction , define
Exact mass balance requires every component of to vanish. Closure gives automatically, so this residual has only two independent components. A zero sum alone does not imply that the component balances hold.
When the phase fraction is unknown and the endpoints are distinct, an unweighted least squares tie-line phase-fraction fit minimizes the squared Euclidean norm of . Differentiating gives
This is an orthogonal projection onto the line through the endpoints. A physically admissible phase fraction also lies in ; if the unconstrained fit lies outside that interval, the closest admissible composition is an endpoint of the line segment. Coincident endpoints do not determine a phase fraction through this formula.
For the hypothetical endpoints and , the composition gives and zero residual. Changing the overall composition to preserves closure but gives
No adjustment of a single phase fraction can eliminate that discrepancy under the stipulated exact endpoints. For experimental use, its significance depends on measurement uncertainty in both the overall composition and endpoint compositions. Unweighted distance is a chosen metric, not an automatic statistical rejection threshold; correlated composition errors require their covariance matrix on the independent composition coordinates. Even a tiny residual establishes only compatibility with this mass balance, not equality of chemical potentials or stability of the proposed liquid-liquid equilibrium.
Totally separated space 2026-10-31
A topological space is totally separated when any two distinct points are separated by a clopen set. Such a space has no nontrivial connected subset. A zero-dimensional space with its usual clopen-base definition and is totally separated. Conversely these conditions agree for compact Hausdorff spaces by the Šura-Bura lemma and compactness, although the definitions should not be conflated for arbitrary spaces. Any closed totally separated subset of the unit square is nowhere dense, since every nonempty relatively open subset of the square contains a nontrivial connected line segment. Restricting a clopen set separating the segment's endpoints would disconnect that segment.
For speed in the punctured plane, the travel-time element is . Under the inversion in a circle with radial coordinate , this becomes , the arc length in Euclidean space divided by . Thus a shortest travel-time route corresponds to a straight line segment in the inverted plane, whenever that segment avoids the origin and lies in the allowed region. Between and the inverted segment has equation . The route is , and its minimum travel time is . The triangle inequality for arc length proves global minimality.
Triangle Created 2026-09-24 Updated 2026-10-14
A triangle is the convex hull of three noncollinear points: the three vertices must not lie on one line. Its boundary consists of the three joining line segments; depending on context, "triangle" can mean this boundary or the filled region it encloses. Here a triangle's area refers to the filled region. The noncollinearity assumption excludes a collapsed shape with zero area, for which ordinary interior angles are not defined.
For example, the positions , and form a right triangle with a right angle at the origin. Taking the side of length as its base gives perpendicular height , so its area is . The height is measured at a right angle to the chosen base; it is not generally the length of another side. In this example it happens to be a side because the triangle is a right triangle.
By contrast, side lengths define a valid triangle: each side is shorter than the sum of the other two, as required by the strict triangle inequality. But , so this is not a right triangle and the Pythagorean theorem cannot calculate its longest side from the other two. The law of cosines instead gives the opposite interior angle through
This example separates the definition of a triangle from the additional assumption of a right angle.
Every triangle in the Euclidean plane has interior angles summing to radians, a result proved in Euclid's Elements I.32.[ref] It lets two measured angles determine the third, and underlies the angle-angle criterion for similar triangles. The qualification "Euclidean plane" matters: the earlier spherical triangle demonstrates a different sum.
Triangle inequality Created 2026-09-24 Updated 2026-10-14
A metric satisfies : visiting an intermediate point cannot beat the direct endpoint distance. A norm satisfies the corresponding inequality .
Take , , and . For Euclidean distance, the triangle inequality reads . The direct line segment has metric path length , while the route through has metric path length . For Manhattan distance, the same comparison becomes : both routes are shortest. The line segment and the bent route both become metric geodesics when progress is measured by metric path length. For Chebyshev distance, the direct line segment has metric path length , while the same bent route still costs .
Figure 1.
The same endpoints and routes have different lengths in three metrics
. Details.
Repeated application of the triangle inequality bounds the endpoint distance by the sum along any finite chain of intermediate points. This explains why metric path length is always at least the distance between endpoints. Equality reveals a shortest route, but its shape and uniqueness depend on the chosen metric.
For two noncoplanar triangles, first reject vertices strictly on one side of the other triangle's plane. Otherwise intersect each triangle with the other plane and compare the resulting intervals along the common line. Coplanar triangles require a planar overlap test; zero-area triangles require separate line segment or point tests.
// Target: analysis.bigb
Triangular prism Created 2026-09-24 Updated 2026-11-05
A triangular prism is a prism whose two bases are congruent parallel triangles. One base is a translation of the other by a vector not parallel to its plane. Joining corresponding vertices of a polygon gives three parallelogram side faces, nine edge of a polyhedron segments and six vertices of a polyhedron.
The triangular prism is right when the translation vector is perpendicular to the base plane. Only in that case is it an orthogonal Cartesian product of a triangle with a line segment. An oblique triangular prism still has volume , where is its base area and the perpendicular separation of the base planes; equal parallel cross sections give this formula by integration.
Vector graphics 2026-10-13
Vector graphics represent a picture by geometric objects and instructions for drawing them: positions, shapes, fills, boundary strokes and transformations. A circle can be stored as a centre and radius; a rectangle as a corner, width and height; a polygon as an ordered list of vertices. These geometric primitives describe whole objects rather than assigning a colour to every pixel. SVG provides elements for such basic shapes and for paths assembled from line segments and curves.[ref]
The useful separation is between the stored geometry and the finite output. A circle of radius 2 remains the same geometric description whether rendered across twenty or two thousand output pixels. This is the sense in which vector graphics are resolution independent: increasing the output grid can evaluate the original geometry again. The resulting raster image still has finite spatial resolution, and numerical coordinates have finite precision. Enlarging a previously rendered raster image through interpolation instead works with its existing samples. Neither operation guarantees that arbitrarily thin details remain visible at every size.
An SVG path uses a current point and drawing commands. For example, M 1 4 L 5 4 L 3 1 Z moves to , draws two line segments, then closes back to the starting point, giving a triangle. Uppercase commands use absolute coordinates; the corresponding lowercase commands use offsets from the current point. Thus M 1 4 l 4 0 l -2 -3 z describes the same triangle. The coordinates belong to the current user Cartesian coordinate system, not necessarily to output pixels.[ref]
For a curved example, the path M 1 4 Q 3 0 5 4 Z uses one quadratic Bézier curve followed by a closing line segment. With control points , and , its curved boundary is
The endpoints are , and ; the interior control point is not a point on the curve. A fill paints the enclosed region, while a stroke paints a band around its boundary with a chosen width. One can use either or both: geometry and paint instructions are distinct.[ref][ref]
Figure 1.
Analytical path illustration: a quadratic Bézier boundary and its affine image
. Details.
The first illustration uses increasing downward, following the initial SVG coordinate convention. Its dashed control polygon guides the eye; it is not part of the filled path. Apply the affine map
This combines horizontal scaling, a shear mapping and a translation. The transformed control points are , and , giving the path M 4.5 5 Q 5.5 1 10.5 5 Z. Its curved midpoint is . The affine equivariance of a geometric basis explains why transforming only the control points transforms the entire Bézier curve: its weights sum to one, so the translation is added exactly once. The enclosed area is before transformation and afterwards. These checks concern the filled region, excluding the width of any stroke.
An SVG viewBox specifies a rectangle in user coordinates to map into a display region. For example, viewBox="0 0 6 6" in a square viewport of 120 by 120 display units gives a scale of 20 display units per user unit; in a square viewport of 600 by 600 it gives 100. The path's control points need not change. For unequal proportions, preserveAspectRatio controls whether the mapping preserves proportions or stretches the axes separately. These display units need not correspond one for one to physical display pixels.[ref][ref]
Rasterization converts the geometric drawing into a raster image on a chosen grid. Deciding whether each pixel centre lies inside a filled region is a simple rule, but a moving diagonal boundary can make entire pixels switch abruptly. Antialiasing reduces these sampling artifacts by accounting for a footprint around each sample, rather than treating every pixel as a single inside-or-outside decision. This connects vector graphics to raster sampling and reconstruction and aliasing; a finer grid and a better sampling rule solve different parts of the problem.
For an exact analytical model, fill the region . For a square pixel footprint , let
Here is geometric coverage, and is relative luminance for ideal opaque neutral shades, with and . The intersection and area determine how much of the footprint is covered. This is a specified area-average model, not a claim that every SVG renderer uses exact coverage. The SVG shape-rendering property supplies rendering hints and permits implementation tradeoffs, including disabling antialiasing for some choices.[ref]
Figure 2.
Analytical rasterization model: pixel-centre decisions versus exact coverage on two grids
. Details.
On the grid of unit squares, has coverage , whereas the pixel centre lies inside and gives coverage 1 under the centre rule. The adjacent square has coverage but its centre lies outside. The entire filled area is . Summing exact coverage times cell area gives this value on both the and grids; the coarse centre rule instead gives 10. Coverage values are displayed after sRGB encoding of the modeled relative luminance. The thin coloured line is a geometry overlay, not an extra sampled stroke. Enlarging the middle panel by nearest-neighbor interpolation would repeat its sixteen values; re-rendering the geometry produces the 256 independently evaluated footprints in the right panel. Antialiasing reduces abrupt edges but cannot make a finite grid preserve every geometric detail.
The attractive feature of vector graphics is editability at the level of intent: move one control point to bend a boundary, change a circle's radius, or transform a whole diagram while keeping its parts aligned. Logos, technical diagrams and outline fonts benefit because their structure can be expressed with relatively few shapes and curves. A complicated photograph may require enormous geometric detail, so vector graphics do not imply a smaller file than raster graphics. Nor does an SVG container guarantee that every object is vector geometry: its image element can embed or reference a PNG raster image. Transforming that embedded raster image changes its placement and reconstruction, but does not recover missing original detail.[ref]