#ComputationalGeometry
October 4, 2025 at 6:12 AM
Just implemented metric-aware Delaunay Triangulation on the sphere 🟣 Metric-aware => Every triangle respects the spherical metric, not the Euclidean one. Algorithm described below.

#indiedev #gamedev #computergraphics #computationalgeometry #topology
October 7, 2025 at 2:58 AM
Extended my topology libs to work on non-Euclidean domains (spherical, toroidal, etc.) by turning mesh edges into geodesics. Below: Bridson's Poisson disk sampling across different domains.

#indiedev #gamedev #computergraphics #computationalgeometry #topology
October 3, 2025 at 8:51 PM
My library TopoKit is essentially a DCEL/half-edge wrapper. I've now added support for face/edge/vertex attributes, and propagation of those during mesh operations.

#indiedev #gamedev #procgen #dcel #halfedge #computationalgeometry #topology
September 17, 2025 at 6:27 AM
Playing a little bit more with my new HEALPix framework. I took this 27360x13680 lat-long map from NASA Scientific Visualization Studio.

#indiedev #gamedev #computergraphics #computationalgeometry #topology
October 12, 2025 at 4:11 AM
Poisson disk sampling constrained to another Poisson disk sampling. Valid positions for the large dots are constrained to positions from the small dots.

#gamedev #indiedev #procedural #computationalgeometry #algorithms
September 6, 2025 at 9:27 PM
If you fly a plane while maintaining a constant compass heading, you'll trace a STRAIGHT line on a Mercator projection map, but your actual trajectory on the planet will SPIRAL into one of the poles.

#indiedev #gamedev #computergraphics #computationalgeometry #topology
October 23, 2025 at 5:52 AM
Testing my topology (DCEL/half-edge) library a little bit. Some Conway operators on a polyhedron and Catmull-Clark SubDiv. Simple matcap rendering in the viewport.

#indiedev #gamedev #procgen #dcel #halfedge #computationalgeometry #topology
September 18, 2025 at 4:33 AM
I've extended my terrain streaming libraries to the sphere using HEALPix partitioning. Hysteresis radii for CPU/GPU load/activate, per-frame command budgets and sphere subdivision are all configurable.

#indiedev #gamedev #computergraphics #computationalgeometry #topology
October 17, 2025 at 5:27 AM
This is my spherical terrain streaming demo sourced with a large dataset (200MB: about 1px every 2km) diced into 1-file per region with LZ4 compression and a TOC for fast pull-a-tile-by-its-ID.

#indiedev #gamedev #computergraphics #computationalgeometry #topology
October 19, 2025 at 12:05 AM
🎉 Yuan Sha and Joachim Gudmundsson's paper "Linear time single-source shortest path algorithms in Euclidean graph classes" has been accepted at #SoCG2026!

🔗 More about SoCG'26: computational-geometry.org/cg-week/socg/
👤 @jgudmundsson.bsky.social

#computationalgeometry #theory #algorithms
Computational Geometry
computational-geometry.org
February 10, 2026 at 12:20 AM
🎉 André van Renssen and Shuei Sakaguchi (PhD student)'s paper "Local Routing on Ordered Θ-graphs" has been accepted at #ISAAC2025!
🔗 More about ISAAC'25: isaac2025.csie.ncku.edu.tw

#Algorithms, #ComputationalGeometry
isaac2025.csie.ncku.edu.tw
September 2, 2025 at 12:52 AM
Little viz of Lloyd's relaxation: iteratively move random points to their Voronoi cell centroids, naturally organizing into a hex-dominant grid. Gray trails show each point's journey from chaos to order.

#voronoi #computationalgeometry #algorithms #math
September 4, 2025 at 1:57 AM
🎉 Our PhD student Zijin Huang's paper "Faster Fréchet Distance under Transformations" has been accepted at #ICALP2025! Check it out here: arxiv.org/abs/2501.12814

🔗 More about ICALP'25: conferences.au.dk/icalp2025
#Research #Theory #Algorithms #ComputationalGeometry #TCSSky
Faster Fréchet Distance under Transformations
We study the problem of computing the Fréchet distance between two polygonal curves under transformations. First, we consider translations in the Euclidean plane. Given two curves $π$ and $σ$ of total...
arxiv.org
April 29, 2025 at 1:51 AM
🎉 Xiu-Chuan Li and Tongliang Liu's paper "Causal Effect Identifiability in the Presence of Latent Confounders Without Auxiliary Variables" has been accepted at #ICML2026! #computationalgeometry

🔗 More about ICML: icml.cc

#machine #learning #casual #inference
May 8, 2026 at 12:52 AM
🎉 Joachim Gudmundsson's paper "A well-separated pair decomposition for low density graphs" has been accepted at #SODA2026!

📝 Paper: arxiv.org/abs/2411.08204
🔗 More about SODA'26: www.siam.org/conferences-...

#Algorithms #TCSSky #ComputationalGeometry #SIAMDA26
A well-separated pair decomposition for low density graphs
Low density graphs are considered to be a realistic graph class for modelling road networks. It has advantages over other popular graph classes for road networks, such as planar graphs, bounded highwa...
arxiv.org
October 6, 2025 at 9:25 PM
🎉 Andre Van Renssen's paper "Visibility Queries in Simple Polygons" has been accepted at #ICALP! #computationalgeometry

🔗 More about ICALP: icalppodcspaa2026.cs.rhul.ac.uk/icalp/

arxiv.org/pdf/2605.03334
May 8, 2026 at 12:45 AM
📐Stuck on Geometry? Get Reliable Homework Assistance!

✅ +91-9878492406
📩 support@onlinecollegehomeworkhelp.com
🌐 onlinecollegehomeworkhelp.com/geometry-tut...

#onlinecollegehomeworkhelp #geometrymath #computationalgeometry #geometryhomeworkhelp #geometryassignmenthelp #geometrytutoringhelp
February 12, 2025 at 4:07 AM
Just read this: O(n log n) shortest paths in disk graphs — a major step for geometric routing and wireless networks. Clean and elegant work. 🔗 https://arxiv.org/abs/2506.07571 #algorithms #computationalgeometry
July 19, 2026 at 9:19 AM
📣 Meet the MATH+ Hanna Neumann Fellows 2026, Hana Dal Poz Kouřimská and Luisa Plato, apart from the previously introduced HNF Caroline Namanya!

👉 Read the full interview here: tinyurl.com/yeb4uwkw

#mathplusresearch #hannaneumannfellowship #womeninmath #phdberlin #computationalgeometry #pde
September 9, 2026 at 9:49 AM
Always nice to see my grad school research cited even if I haven't done anything new in the field for over 25 years. arxiv.org/abs/2412.08165

#ComputationalGeometry #WellSeparatedPairDecomposition #CS
December 17, 2024 at 6:42 PM
Researchers introduced an algorithm that enumerates at most k‑out polygons with O(n² log n) delay, improving on the previous O(n³ log n) bound. The work was submitted in Sep 2025. https://getnews.me/new-algorithm-speeds-up-enumeration-of-at-most-k-out-polygons/ #computationalgeometry #algorithm
September 18, 2025 at 10:09 AM