FSTTCS 2007 - PDF Preprint Papers

FSTTCS 2007 Foundations of Software Technology and Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FSTTCS-2007 Paper

click to vote

FSTTCS
2007
Springer

166views Software Engineering» more FSTTCS 2007»

Triangulations of Line Segment Sets in the Plane

14 years 5 months ago

Download www.mage.fst.uha.fr

Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...

Mathieu Brévilliers, Nicolas Chevallier, Do...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	166	Triangulations of Line Segment Sets in the Plane	claim
2	154	"Rent-or-Buy" Scheduling and Cost Coloring Problems	claim
3	154	Efficient and Expressive Tree Filters	claim
4	148	Better Algorithms and Bounds for Directed Maximum Leaf Problems	claim
5	144	Covering Graphs with Few Complete Bipartite Subgraphs	claim
6	138	Automata and Logics for Timed Message Sequence Charts	claim
7	135	Adventures in Bidirectional Programming	claim
8	132	Undirected Graphs of Entanglement 2	claim
9	132	Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem	claim
10	129	On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography	claim
11	128	Propositional Dynamic Logic for Message-Passing Systems	claim
12	123	Satisfiability of Algebraic Circuits over Sets of Natural Numbers	claim
13	121	Acceleration in Convex Data-Flow Analysis	claim
14	120	A Theory for Game Theories	claim
15	113	Solving Parity Games in Big Steps	claim
16	111	Symbolic Bisimulation for the Applied Pi Calculus	claim
17	107	Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths	claim
18	103	Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections	claim
19	96	Non-mitotic Sets	claim
20	96	Closures and Modules Within Linear Logic Concurrent Constraint Programming	claim
21	95	A Formal Investigation of	claim
22	93	Safely Composing Security Protocols	claim
23	93	Order Scheduling Models: Hardness and Algorithms	claim
24	92	Program Analysis Using Weighted Pushdown Systems	claim
25	92	The Complexity of Zero Knowledge	claim
26	91	The Multicore Revolution	claim
27	90	Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption	claim
28	90	Reductions to Graph Isomorphism	claim
29	84	Strong Reductions and Isomorphism of Complete Sets	claim
30	83	Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems	claim
31	79	Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space	claim
32	78	The Deduction Theorem for Strong Propositional Proof Systems	claim
33	78	Markov Decision Processes with Multiple Long-Run Average Objectives	claim
34	74	Probabilistic and Topological Semantics for Timed Automata	claim
35	74	Synthesis of Safe Message-Passing Systems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers