Splitting a configuration in a simplex

DOI10.1007/BF01190161zbMath0781.68122OpenAlexW1967290491MaRDI QIDQ2366245

Takeshi Tokuyama, Kazumiti Numata

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190161

zbMATH Keywords

triangulationpoints dissection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

A survey of mass partitions ⋮ Geometric algorithms for the minimum cost assignment problem ⋮ Weighted skeletons and fixed-share decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-skeletons in arrangements with applications
• Time bounds for selection
• Triangulating point sets in space
• NP-complete stable matching problems
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS

This page was built for publication: Splitting a configuration in a simplex