The shape descends directly from a 1928 discovery by the German mathematician Erik Schönhardt, who constructed a deceptively simple object: a triangular prism twisted so that its two triangular ends rotate out of alignment. In this twisted prism, Schönhardt showed, every diagonal that is not part of the boundary lies entirely outside the body. Pick any four of its six vertices and the tetrahedron they span pokes out of the solid. There is, quite literally, no interior tetrahedron compatible with the twisted faces, so the shape cannot be divided into tetrahedra without adding new points. In 1911, N. J. Lennes had already sketched a similar obstruction, but Schönhardt’s six-vertex example became the canonical specimen, and he proved that any simple polyhedron with the same property needs at least six vertices.

For nearly a century, mathematicians refined and extended this three-dimensional curiosity. Bagemihl replaced one twisted edge with a concave curve studded with extra vertices, producing nontriangulable polyhedra with any number of vertices from six upward. Rambau widened the top and bottom triangles into larger polygons, obtaining twisted prisms over any n-gon. Kuperberg produced an even stranger body in which no tetrahedron built from the original vertices contains the body’s midpoint. What all of these examples share is a single common thread: a fixed boundary face that cannot be extended into a simplex lying wholly inside the solid, either because every candidate simplex sprouts an exterior edge or because the combinatorics of the face lattice forbid a compatible decomposition.

The new work, published in the open-access journal Heliyon by Antal Joós, Attila Kovari, and Bálint Nagy, takes the decisive step into the fourth dimension. The authors construct an eight-vertex body they call B: take a regular tetrahedron as the base, place a second tetrahedron parallel to it at height 2, and rotate the top copy by a small angle of negative 0.01 radians within the appropriate coordinate plane. The convex hull of these eight points is a twisted four-dimensional prism. The mathematicians then carve away four carefully chosen four-dimensional simplices whose interiors are pairwise disjoint, and what remains is a genuine 4-polytope whose facets are all tetrahedra, a direct higher-dimensional analogue of Schönhardt’s construction.

The proof of nontriangulability is a small masterpiece of algebraic bookkeeping. The authors introduce a determinant function that measures, for any point in four-dimensional space, which side of a hyperplane it lies on. Exact sign computations show that the four removed simplices are cleanly separated, that the eight designated points are truly vertices, and that a specific interior point q, the average of all eight vertices, survives the carving and sits strictly inside the remaining body. The crux comes from the base facet: in any hypothetical triangulation, that tetrahedral facet must itself be the face of some 4-simplex, and the only candidates are the four simplices obtained by joining the base to one of the four top vertices. Each of these, the determinant tables show, overlaps the interior of one of the removed pieces. No candidate fits. The contradiction is absolute, and the four-dimensional body is certified nontriangulable.

Remarkably, the obstruction is robust. Because the proof rests on strict determinant inequalities, small perturbations of the vertex positions or the twist angle preserve nontriangulability, meaning the example is not a knife-edge accident but a stable geometric phenomenon. The authors leave tantalizing questions open: over exactly what range of rotation angles does the body remain nontriangulable, what affine transformations can the tetrahedral layers tolerate, and could cubes or other shapes replace the tetrahedra in the construction?

Equally important are the dimension-raising lemmas that follow. The team proves that a pyramid erected over any nontriangulable base is itself nontriangulable, that any polytope carrying a nontriangulable facet in a supporting hyperplane inherits the property, and that bipyramids and suitably split bodies extend the same obstruction upward. These lemmas generate infinite families of nontriangulable polytopes in every dimension from four upward. With characteristic rigor, the authors also demonstrate the limits of such inheritance: they exhibit a four-dimensional body that is perfectly triangulable yet whose cross-section is the nontriangulable Schönhardt polyhedron, proving that a bad cross-section alone does not doom a higher-dimensional body. The precise sufficient conditions, distilled into their Proposition 1, specify exactly when a nontriangulable three-dimensional time slice forces the full four-dimensional spacetime body to be nontriangulable.

That spacetime framing is where the mathematics collides with the real world. Many modern engineering and medical problems treat time as a genuine fourth coordinate: a beating heart imaged by 4D CT, airways swelling and contracting through the breathing cycle, coronary arteries reconstructed dynamically for fluid simulations, robots navigating a workspace while an explicit clock ticks. In each case, the natural geometric object is a four-dimensional polyhedral body, and the natural discretization is a mesh of 4-simplices, the four-dimensional analogues of tetrahedra. The new theorems show that when the underlying three-dimensional geometry is sufficiently twisted or nonconvex and the conditions of Proposition 1 hold, simplex-only meshes built from the original sampled vertices are not merely inconvenient but mathematically impossible. Software must insert additional Steiner points or refine the domain, and the new results quantify why that insertion is unavoidable rather than a limitation of current algorithms.

The medical implications are concrete. The inner surface of a heart ventricle is grooved and trabeculated, and if that nonconvexity is strong enough, even a single three-dimensional snapshot can resemble a theoretical twisted polyhedron; stacking the cardiac cycle into a four-dimensional mantle may inherit the meshing obstruction. Bronchial trees, with their branching curvatures and pocketed geometry, present similar risks. In robotics, motion planning through elongated twisted corridors, or coordination of multiple arms whose combined configuration spaces are highly nonconvex, may force planners to add nodes or refine the discretized space in ways the theorems now anticipate. Engineers analyzing deforming fuselages, thermally buckling structures, or pressure-fluctuating pipelines face the same lesson whenever a three-dimensional shape deforms through time in a nontriangulable fashion.

The authors are candid about the computational frontier that remains. Deciding whether an arbitrary polytope is nontriangulable is hard, and even minimum-size triangulations of convex three-dimensional polytopes are known to be NP-hard, so every guaranteed Steiner point carries a cost that can grow with geometric complexity. The new certification for the four-dimensional family, however, is refreshingly checkable: the determinant signs can be evaluated directly from the vertex coordinates. Future work will need adaptive algorithms for optimal Steiner placement, robustness analysis under the noisy vertex data that real medical imaging delivers, and possibly machine-learning heuristics to predict which configurations demand extra points. For now, the message of this paper resonates far beyond the seminar room: nontriangulability is no three-dimensional curiosity. It lives robustly in higher dimensions, it travels through time, and it tells the engineers and clinicians of the four-dimensional data age exactly when their meshes must break the old rules and add new points.

Subject of Research: Higher-dimensional nontriangulable polytopes and their role in spacetime mesh generation

Article Title: Higher-dimensional nontriangulable polytopes: Theory, proofs, and implications in engineering and medical simulation

Article References: Joós, A., Kovari, A., & Nagy, B. (2026). Higher-dimensional nontriangulable polytopes: Theory, proofs, and implications in engineering and medical simulation. Heliyon, 12(15), Article e45442. https://doi.org/10.1016/j.heliyon.2026.e45442

Image Credits: AI Generated

DOI: 10.1016/j.heliyon.2026.e45442

Keywords: nontriangulable polytopes, Schönhardt polyhedron, computational geometry, triangulation, four-dimensional geometry, Steiner points, mesh generation, 4D medical imaging, robot motion planning, combinatorics, polytopes, spacetime meshing

Most previous research in this area has concentrated on identifying single landing coordinates for small unmanned aerial vehicles. A quadcopter losing a motor needs a spot of ground measured in meters; a general-purpose aircraft needs a corridor, an extended strip whose length, width and straightness must all be verified simultaneously. The Moroccan team identified this as a fundamental gap: no widely adopted method existed to move beyond isolated landing points and automatically detect and outline full viable landing strips from imagery alone. Their answer was to reformulate the entire problem as one of geometric optimization, layered on top of a modern deep learning segmentation engine.

The first stage of the pipeline tackles the question of what terrain is safe to land on at all. The researchers built a hybrid deep learning model that fuses two complementary architectures: U-Net, a convolutional neural network originally developed for biomedical image segmentation, and SegFormer, a Transformer-based model that captures long-range context across an image. Rather than forcing a choice between the two, the team combined them through an ensemble method, blending their outputs so that the local, detail-sensitive reasoning of the convolutional network reinforces the global scene understanding of the Transformer, and vice versa. The result is a robust binary segmentation mask that classifies every pixel of an aerial image as either safe-to-land terrain or unsafe ground.

Technically, the pairing is well motivated. U-Net’s encoder-decoder structure excels at preserving fine spatial boundaries, while SegFormer’s self-attention mechanism allows it to reason about relationships between distant regions of a scene, such as whether a seemingly clear field is bounded by trees, power lines or buildings. This architecture hybridization reflects a broader trend in semantic segmentation research, where convolutional and attention-based approaches are increasingly merged to capture both fine texture and scene-level semantics. On a custom dataset of aerial imagery of Moroccan terrain, previously assembled and pixel-wise labeled by the same group for exactly this application, the ensemble achieved a Mean Intersection-over-Union of 80.84 percent for the segmentation task, a strong score indicating substantial agreement between the model’s safe-terrain masks and ground-truth annotations.

The segmentation mask, however, is only raw material. A safe region shaped like an amoeba is useless to a descending aircraft; what matters is the largest rectangle of contiguous usable ground that can be inscribed within it. That is the second and arguably most original contribution of the study: a novel, efficient algorithm that finds the Longest Inscribed Rectangle, which the authors abbreviate as LNIR, within any binary mask. The rectangle that solves this geometric optimization problem corresponds directly to the optimal landing strip, because it captures the maximal continuous run of terrain that satisfies the shape constraint an actual aircraft approach demands.

Geometric optimization problems of this kind are notoriously difficult. Finding the largest rectangle inside an arbitrary polygonal region is a classic problem in computational geometry, and naive approaches scale poorly with image size. The LNIR algorithm is designed for efficiency, operating directly on the segmentation output and extracting the best-fit strip without exhaustive search. Crucially, the team also generalized the method to handle strips of arbitrary orientation. A viable field does not care about the axes of the image grid, so the algorithm iteratively rotates the search space, re-evaluating candidate rectangles at each angle until the orientation yielding the longest inscribed strip is found. This rotation strategy ensures the method works equally well for a runway aligned north-south, east-west or anywhere in between.

Real-world deployment demands more than accuracy in ideal conditions. Emergency landings do not wait for clear skies, so the researchers stress-tested the framework under simulated adverse weather, applying fog and rain degradations to their imagery and re-running the full pipeline. The system maintained high performance despite the visual corruption, demonstrating a robustness that is essential for any safety-critical application. Fog and rain reduce contrast, blur edges and shift color distributions, conditions that routinely break computer vision systems trained on clean data; the fact that this pipeline survives them suggests the ensemble segmentation approach learns features that are genuinely structural rather than merely textural artifacts of fair weather.

Equally important is speed. The entire pipeline, from raw aerial image to delineated landing strip, demonstrates real-time capability, meaning it can in principle keep pace with the continuously updating view from an aircraft-mounted camera or an unmanned scout vehicle. The researchers frame the work as a powerful automated tool for a critical aviation safety application, and they have made the ingredients available to the community: the dataset of pixel-wise labeled Moroccan emergency landing sites is hosted on Mendeley Data, and the code implementing the LNIR method is publicly accessible on GitHub, lowering the barrier for other groups to reproduce, benchmark and extend the approach.

The implications extend beyond the immediate use case. The authors position the LNIR algorithm as a versatile geometric optimization tool with potential for broader feature extraction from remote sensing data anywhere that elongated rectangular structures matter. Road and railway segment extraction, agricultural strip monitoring, solar farm siting, vegetation corridor analysis and pipeline inspection all reduce, at some level, to finding the best inscribed or aligned rectangle within a classified region, and an efficient, rotation-invariant solver for that problem is a reusable piece of scientific infrastructure. The work also arrives at a moment when hybrid CNN-Transformer segmentation models are proliferating across remote sensing, from urban scene parsing to geological structure detection, and the Moroccan study offers a concrete demonstration that such hybrids can be pushed all the way through to actionable geometric outputs rather than stopping at pixel labels.

There remain, of course, the usual caveats separating an academic pipeline from certified flight hardware. The evaluation relied on a custom dataset drawn from Moroccan terrain, and generalization to deserts, forests, snowfields or dense urban environments would require further validation. The segmentation accuracy of roughly 81 percent IoU, while impressive, leaves room for error in exactly the boundary regions that determine whether a strip is long enough. And any autonomous emergency system would eventually need to integrate additional sensing modalities such as LiDAR depth information, account for slope and surface bearing strength, and satisfy the exacting certification standards of aviation regulators. Still, the conceptual leap is clear and consequential: the study shows that the full chain from aerial photograph to quantified, oriented, optimal landing strip can be automated end to end, in real time, in bad weather. For a pilot gliding toward unfamiliar ground with failing systems, that chain could one day mean the difference between guessing and knowing where the aircraft can safely come to rest.

Subject of Research: Automated detection and geometric delineation of emergency landing strips in aerial imagery using hybrid deep learning segmentation and a longest inscribed rectangle optimization algorithm

Article Title: Automated Delineation of Viable Emergency Landing Strips in Aerial Imagery Using a Novel Geometric Optimization Algorithm

Article References: Illi, A., Bouzaachane, K., El Hadaj, S., & El Guarmah, E. M. (2026). Automated Delineation of Viable Emergency Landing Strips in Aerial Imagery Using a Novel Geometric Optimization Algorithm. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01278-5

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01278-5

Keywords: emergency landing, aerial imagery, deep learning, semantic segmentation, U-Net, SegFormer, computational geometry, geometric optimization, inscribed rectangle, remote sensing, aviation safety, UAV