ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Plane primitives”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CVEmpiricalRecentOct 16, 2026

Persistent Planar Memory for Video World Models

Yuze He, Bin Tan, Zelin Gao, Yujun Shen +3 more

This paper presents PPMem, a video world model that uses plane primitives as persistent 3D memory to generate and explore environments at scale.

View →
cs.CVcs.GREmpiricalRecentJul 24, 2026

Deformable Triangle Splatting: Flexible Primitives for Real-Time Radiance Field Rendering

Oriol Jiménez-Ayguadé, Antonio Agudo

This paper introduces Deformable Triangle Splatting, a method for representing non-convex shapes in radiance fields using triangles with learnable control points, enabling differentiable rendering.

View →
cs.CVcs.AIcs.GREmpiricalRecentOct 27, 2026

Honeycomb-Surfels: Compact Hexagonal Primitives for Efficient Scene Rendering and Reconstruction

Prakhar Kaushik, Soumava Paul, Alan Yuille

This paper introduces Hexels, a novel planar hexagonal surface element for efficient 3D scene and 2D image representation.

View →
cs.CCTheoreticalRecentJul 9, 2026

Minimum Edge-Outerplanar Embeddings are Polynomial-Time Computable

Hantao Yu

This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.

View →
cs.GRcs.CGRecentMay 30, 2026

Subgrid Marching Tetrahedra

Hossein Baktash, Mark Gillespie, Keenan Crane

The paper introduces a subgrid marching tetrahedra scheme that accurately recovers complex, intersection-free manifold meshes from tetrahedral grids, overcoming limitations of classic marching methods…

View →
cs.DScs.CGcs.LGTheoreticalRecentJul 3, 2026

Dimension Reduction for Curves: Simplified and Generalized

Matthijs Ebbens, Jie Lu, Alexander Munteanu

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

View →
cs.PLcs.MSTheoreticalRecentOct 30, 2026

Grassmann: The Coordinate-Independent Linear Algebra Programming Language

Theadora Fields Collin, Gilbert Bernstein, Oded Stein, Saman Amarasinghe

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

View →
cs.CGcs.DSmath.MGTheoreticalRecentJun 15, 2026

A constant-factor approximation of the Gromov-Hausdorff distance in the plane

Sushovan Majhi

The paper provides a polynomial-time constant-factor approximation of the Gromov-Hausdorff distance between finite point sets in the Euclidean plane.

View →
cs.CLcs.AIRecentJun 1, 2026

PlanarBench: Evaluating LLM Spatial Reasoning via Planar Graph Drawing

Oleksandr Nikitin

PlanarBench introduces a novel benchmark to test LLM spatial reasoning by requiring them to draw planar graphs as ASCII art from an edge list, finding that edge count is a stronger difficulty predicto…

View →
cs.CGcs.DSTheoreticalRecentJul 3, 2026

Shortest Path Map Equivalence Decompositions and Applications

Haitao Wang

This paper provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…

View →
cs.CGcs.DMTheoreticalRecentJul 1, 2026

On Reconstructing a Convex Polygon from Partial Information

Alexander Baumann, Therese Biedl, Mahmoud Elashmawi, Simon D. Fink +2 more

This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.

View →
cs.CGRecentMay 29, 2026

How Many Slopes Does Polynomial Area Cost?

Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Maria Eleni Pavlidi

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

View →
cs.DScs.DMTheoreticalRecentJun 29, 2026

Algorithms and complexity for geodetic sets on interval and chordal graphs

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat +1 more

This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on i…

View →
cs.AREmpiricalRecentOct 20, 2026

RPolyPlan: A Unified Global Floorplanning and Legalization Framework for Rectilinear Soft Modules

Fuxing Huang, Wenxing Zhu, Xinning Liu, Ziran Zhu

This paper presents a unified framework for floorplanning that incorporates continuously deformable rectilinear polygons into global floorplanning.

View →
cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →
cs.CGcs.DMEmpiricalRecentJul 25, 2026

How to Draw a Planar Graph: An Experimental Evaluation

Sergey Pupyrev

This paper experimentally evaluates various planar graph drawing algorithms and compares their performance in terms of visual properties.

View →