Tag Info

New answers tagged

2

If I understood you correctly, this set of definitions would do what you wrote: ClearAll[cut] cutFunction[miller_, c_] := miller.{x, y, z} + c >= 0 cutSimplify[expr_] := Simplify[expr /. cut -> cutFunction] cut /: HoldPattern[Times[cut[m_, c_], s_]] /; s > 0 := cut[m, s c]; cut /: HoldPattern[Times[cut[m_, c_], s_]] /; s < 0 := cut[-m, s c]; ...


7

The code below is a bit of a cheat: it modifies sets acquired through cylindrical decomposition by converting < to <= and > to >=. This prevents some infinitesimally small gaps from being recognised as such, but wins the possibility of finding overlaps between cylindrical cells produced by CAD. It may still serve as a starting point for more ...


2

The most powerful tensor package suit for MMA (and arguably for any CAS) is xAct. It uses the full machinery of diff geometry (fiber bundles, connections, forms, ect) and a powerful canonicalization algorithm, both symbolically and numerically. Obviouly you can use just a fraction of this power. I am the developer of xPrint, the GUI interface to xAct. With ...



Top 50 recent answers are included